Lazy Modulus Switching for the BKW Algorithm on LWE - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

Lazy Modulus Switching for the BKW Algorithm on LWE

Jean-Charles Faugère
Robert Fitzpatrick
  • Function : Author
  • PersonId : 935333
Ludovic Perret
  • Function : Author
  • PersonId : 935330
  • IdRef : 123278864


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.
Fichier principal
Vignette du fichier
bkw-small-secret.pdf (386.18 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00925187 , version 1 (07-01-2014)


  • 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⟩
573 View
359 Download


Gmail Facebook X LinkedIn More