On the Hardness of LWE with Binary Error: Revisiting the Hybrid Lattice-Reduction and Meet-in-the-Middle Attack
- 7 April 2016
- book chapter
- Published by Springer Nature
- Vol. 2016, 24-43
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- On Ideal Lattices and Learning with Errors over RingsJournal of the ACM, 2013
- On the complexity of the BKW algorithm on LWEDesigns, Codes and Cryptography, 2013
- Lattice Signatures and Bimodal Gaussians2013
- Hardness of SIS and LWE with Small Parameters2013
- Lossy Trapdoor Functions and Their ApplicationsSIAM Journal on Computing, 2011
- Concise Formulas for the Area and Volume of a Hyperspherical CapAsian Journal of Mathematics & Statistics, 2010
- Choosing NTRUEncrypt Parameters in Light of Combined Lattice Reduction and MITM Approaches2009
- Noise-tolerant learning, the parity problem, and the statistical query modelJournal of the ACM, 2003
- On Lovász’ lattice reduction and the nearest lattice point problemCombinatorica, 1986
- On Lovász' lattice reduction and the nearest lattice point problem1984