Publication | Closed Access
Classical hardness of learning with errors
584
Citations
18
References
2013
Year
Unknown Venue
Mathematical ProgrammingQuantum ScienceEngineeringQuantum ComputingComputational Learning TheoryQuantum Optimization AlgorithmLattice (Order)Quantum Machine LearningAlgorithmic LearningQuantum AlgorithmClassical HardnessComputational ComplexityComputer ScienceAlgorithmic Information TheoryApproximation TheoryLattice TheoryQuantum Reductions
We show that the Learning with Errors (LWE) problem is classically at least as hard as standard worst-case lattice problems. Previously this was only known under quantum reductions.
| Year | Citations | |
|---|---|---|
Page 1
Page 1