Communication Dans Un Congrès Année : 2012

On the complexity of the Arora-Ge Algorithm against LWE

Résumé

Arora & Ge recently showed that solving LWE can be reduced to solve a high-degree non-linear system of equations. They used a linearization to solve the systems. We investigate here the possibility of using Gr¨obner bases to improve Arora & Ge approach.

Fichier principal
Vignette du fichier
SCC_AG_2012.pdf (112.09 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-00776434 , version 1 (15-01-2013)

Licence

Identifiants

  • HAL Id : hal-00776434 , version 1

Citer

Martin Albrecht, Carlos Cid, Jean-Charles Faugère, Robert Fitzpatrick, Ludovic Perret. On the complexity of the Arora-Ge Algorithm against LWE. SCC 2012 -- Third international conference on Symbolic Computation and Cryptography, Jul 2012, Castro Urdiales, Spain. pp.93-99. ⟨hal-00776434⟩
627 Consultations
1846 Téléchargements

Partager

  • More