International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions

Authors:
Daniele Micciancio
Petros Mol
Download:
DOI: 10.1007/978-3-642-22792-9_26 (login may be required)
URL: https://www.iacr.org/archive/crypto2011/68410461/68410461.pdf
Search ePrint
Search Google
Presentation: Slides
Conference: CRYPTO 2011
BibTeX
@inproceedings{crypto-2011-23590,
  title={Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions},
  booktitle={Advances in Cryptology - CRYPTO 2011 - 31st Annual Cryptology Conference},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={6841},
  pages={461},
  url={https://www.iacr.org/archive/crypto2011/68410461/68410461.pdf},
  doi={10.1007/978-3-642-22792-9_26},
  author={Daniele Micciancio and Petros Mol},
  year=2011
}