On the complexity of the BKW algorithm on LWE - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Designs, Codes and Cryptography Year : 2015

On the complexity of the BKW algorithm on LWE


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 re ned estimates for the data and computational e ort requirements for solving concrete instances of the LWE problem. We apply this re ned analysis to suggested parameters for various LWE-based cryptographic schemes from the literature and compare with alternative approaches based on lattice reduction. As a result, we provide new upper bounds for the concrete hardness of these LWE-based schemes. Rather surprisingly, it appears that BKW algorithm outperforms known estimates for lattice reduction algorithms starting in dimension n= 250 when LWE is reduced to SIS. However, this assumes access to an unbounded number of LWE samples.
Fichier principal
Vignette du fichier
636.pdf (306.72 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00921517 , version 1 (06-01-2014)



Martin Albrecht, Carlos Cid, Jean-Charles Faugère, Robert Fitzpatrick, Ludovic Perret. On the complexity of the BKW algorithm on LWE. Designs, Codes and Cryptography, 2015, 74 (2), pp.26. ⟨10.1007/s10623-013-9864-x⟩. ⟨hal-00921517⟩
6557 View
829 Download



Gmail Facebook Twitter LinkedIn More