On the Complexity of the BKW Algorithm on LWE
Résumé
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.
Domaines
Cryptographie et sécurité [cs.CR]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|