Skip to Main content Skip to Navigation
Conference papers

Lazy Modulus Switching for the BKW Algorithm on LWE

Abstract : Some recent constructions based on LWE do not sample the secret uniformly at random but rather from some distribution which produces small entries. The most prominent of these is the binary-LWE problem where the secret vector is sampled from $\{0,1\}^{\ast}$ or $\{-1,0,1\}^{\ast}$. We present a variant of the BKW algorithm for binary-LWE and other small secret variants and show that this variant reduces the complexity for solving binary-LWE. We also give estimates for the cost of solving binary-LWE instances in this setting and demonstrate the advantage of this BKW variant over standard BKW and lattice reduction techniques applied to the SIS problem. Our variant can be seen as a combination of the BKW algorithm with a lazy variant of modulus switching which might be of independent interest.
Document type :
Conference papers
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download
Contributor : Ludovic Perret Connect in order to contact the contributor
Submitted on : Tuesday, January 7, 2014 - 4:33:37 PM
Last modification on : Friday, January 21, 2022 - 3:21:53 AM
Long-term archiving on: : Monday, April 7, 2014 - 11:55:23 PM


Files produced by the author(s)


  • HAL Id : hal-00925187, version 1


Martin Albrecht, Jean-Charles Faugère, Robert Fitzpatrick, Ludovic Perret. Lazy Modulus Switching for the BKW Algorithm on LWE. Public-Key Cryptography - PKC 2014 - 17th International Conference on Practice and Theory in Public-Key Cryptography, Mar 2014, Buenos Aires, Argentina. ⟨hal-00925187⟩



Record views


Files downloads