On the complexity of the BKW algorithm on LWE
- 19 July 2013
- journal article
- research article
- Published by Springer Science and Business Media LLC in Designs, Codes and Cryptography
- Vol. 74 (2), 325-354
- https://doi.org/10.1007/s10623-013-9864-x
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Classical hardness of learning with errorsPublished by Association for Computing Machinery (ACM) ,2013
- Efficient Fully Homomorphic Encryption from (Standard) LWEPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2011
- The Learning with Errors Problem (Invited Survey)Published by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- Low-dimensional lattice basis reduction revisitedACM Transactions on Algorithms, 2009
- On lattices, learning with errors, random linear codes, and cryptographyJournal of the ACM, 2009
- Fully homomorphic encryption using ideal latticesPublished by Association for Computing Machinery (ACM) ,2009
- Trapdoors for hard lattices and new cryptographic constructionsPublished by Association for Computing Machinery (ACM) ,2008
- Noise-tolerant learning, the parity problem, and the statistical query modelJournal of the ACM, 2003