On the Complexity of the BKW Algorithm on LWE - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

On the Complexity of the BKW Algorithm on LWE

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


This work presents a study of the complexity of the Blum-Kalai-Wasserman (BKW) algorithm when applied to the Learning with Errors (LWE) problem, by providing refined estimates forthe data and computational effort requirements for solving concrete instances of the LWE problem. We apply this refined analysis to suggested parameters for various LWE-based cryptographic schemes from the literature and, as a result, provide new upper bounds for the concrete hardness of these LWE-based schemes.
Fichier principal
Vignette du fichier
final_BKW.pdf (436.76 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-00776069 , version 1 (14-01-2013)
hal-00776069 , version 2 (16-07-2013)


  • HAL Id : hal-00776069 , version 2


Martin Albrecht, Carlos Cid, Jean-Charles Faugère, Robert Fitzpatrick, Ludovic Perret. On the Complexity of the BKW Algorithm on LWE. SCC 2012 -- Third international conference on Symbolic Computation and Cryptography, Jul 2012, Castro Urdiales, Spain. pp.100-107. ⟨hal-00776069v2⟩
11177 View
767 Download


Gmail Mastodon Facebook X LinkedIn More