On the complexity of the Arora-Ge Algorithm against 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 Arora-Ge Algorithm against 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

Abstract

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
Origin Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

  • HAL Id : hal-00776434 , version 1

Cite

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⟩
293 View
1280 Download

Share

Gmail Mastodon Facebook X LinkedIn More