Skip to Main content Skip to Navigation
Conference papers

On the complexity of the Arora-Ge Algorithm against LWE

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download

https://hal.inria.fr/hal-00776434
Contributor : Ludovic Perret <>
Submitted on : Tuesday, January 15, 2013 - 3:19:32 PM
Last modification on : Friday, January 8, 2021 - 5:42:02 PM
Long-term archiving on: : Tuesday, April 16, 2013 - 3:56:23 AM

Files

SCC_AG_2012.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00776434, version 1

Citation

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⟩

Share

Metrics

Record views

386

Files downloads

1231