Publication | Closed Access
Pseudorandomness of ring-LWE for any ring and modulus
167
Citations
19
References
2017
Year
Unknown Venue
Lattice ProblemsEngineeringPolynomial-time Quantum ReductionQuantum ComputingQuantum Optimization AlgorithmPseudo-random SequencePost-quantum CryptographyRing TheoryCommutative AlgebraQuantum AlgorithmLattice (Order)Computational ComplexityDecision Ring-lweLattice Theory
We give a polynomial-time quantum reduction from worst-case (ideal) lattice problems directly to decision (Ring-)LWE. This extends to decision all the worst-case hardness results that were previously known for the search version, for the same or even better parameters and with no algebraic restrictions on the modulus or number field. Indeed, our reduction is the first that works for decision Ring-LWE with any number field and any modulus.
| Year | Citations | |
|---|---|---|
Page 1
Page 1