Classical hardness of learning with errors
Open Access
- 1 June 2013
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 575-584
Abstract
No abstract availableAll Related Versions
This publication has 36 references indexed in Scilit:
- On lattices, learning with errors, random linear codes, and cryptographyJournal of the ACM, 2009
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems2009
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem2009
- Worst‐Case to Average‐Case Reductions Based on Gaussian MeasuresSIAM Journal on Computing, 2007
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup ProblemSIAM Journal on Computing, 2005
- New lattice-based cryptographic constructionsJournal of the ACM, 2004
- Quantum Computation and Lattice ProblemsSIAM Journal on Computing, 2004
- A Pseudorandom Generator from any One-way FunctionSIAM Journal on Computing, 1999
- New bounds in some transference theorems in the geometry of numbersMathematische Annalen, 1993
- Strong uniform times and finite random walksAdvances in Applied Mathematics, 1987