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.
Domaines
Cryptographie et sécurité [cs.CR]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...