Pages that link to "Item:Q3758904"
From MaRDI portal
The following pages link to Randomized algorithms in number theory (Q3758904):
Displaying 18 items.
- Random arithmetic formulas can be reconstructed efficiently (Q488050) (← links)
- Solovay functions and their applications in algorithmic randomness (Q494057) (← links)
- Super-Golden-Gates for \(PU(2)\) (Q1701020) (← links)
- Randomized proofs in arithmetic (Q1807460) (← links)
- Efficient range proofs with transparent setup from bounded integer commitments (Q2056793) (← links)
- Integral matrix Gram root and lattice Gaussian sampling without floats (Q2119026) (← links)
- Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences (Q2491267) (← links)
- Optimal ancilla-free Pauli+V circuits for axial rotations (Q3463254) (← links)
- (Q3943892) (← links)
- Dirichlet’s proof of the three-square theorem: An algorithmic perspective (Q4561383) (← links)
- Efficient Non-interactive Range Proof (Q5323058) (← links)
- (Q5384335) (← links)
- Removing the Strong RSA Assumption from Arguments over the Integers (Q5738979) (← links)
- Pourchet’s theorem in action: decomposing univariate nonnegative polynomials as sums of five squares (Q6081964) (← links)
- Breaking SIDH in polynomial time (Q6083675) (← links)
- Zero-knowledge arguments for subverted RSA groups (Q6088994) (← links)
- A framework for UC secure privacy preserving biometric authentication using efficient functional encryption (Q6535115) (← links)
- SQIsignHD: new dimensions in cryptography (Q6636383) (← links)
