Skip to Main content Skip to Navigation
New interface

Polynomial systems solving and elliptic curve cryptography

Louise Huot 1 
1 PolSys - Polynomial Systems
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
Abstract : Since the last decade, attacks on the elliptic curve discrete logarithm problem (ECDLP) which requires to solve polynomial systems have been quite successful. This thesis takes place in this context and the contributions are twofold. On the one hand, we present new tools for solving polynomial systems by using Gröbner bases. First, we investigate polynomial systems with symmetries. We show that solving such a system is closely related to solving quasi-homogeneous systems. We thus propose new complexity bounds for solving systems with symmetries. Then, we study the bottleneck of polynomial systems solving: the change of ordering for Gröbner bases. The usual complexity of such algorithms is cubic in the number of solutions and dominates the overall complexity of polynomial systems solving. We propose for the first time change of ordering algorithms with sub-cubic complexity in the number of solutions. On the other hand, we investigate the index calculus attack of Gaudry to solve the elliptic curve discrete logarithm problem. We highlight some families of elliptic curves that admit particular symmetries. These symmetries imply an exponential gain in the complexity of solving the ECDLP. As a consequence, we obtain new security parameters for some instances of the ECDLP. One of the main steps of this attack requires to compute Semaev summation polynomials. The symmetries of binary elliptic curves allow us to propose a new algorithm based on evaluation-interpolation to compute their summation polynomials. Equipped with this algorithm we establish a new record for the computation of these polynomials.
Complete list of metadata

Cited literature [159 references]  Display  Hide  Download
Contributor : Louise Huot Connect in order to contact the contributor
Submitted on : Tuesday, January 7, 2014 - 6:00:12 PM
Last modification on : Friday, January 21, 2022 - 3:21:47 AM
Long-term archiving on: : Tuesday, April 8, 2014 - 12:15:18 AM


  • HAL Id : tel-00925271, version 1


Louise Huot. Polynomial systems solving and elliptic curve cryptography. Symbolic Computation [cs.SC]. Université Pierre et Marie Curie - Paris VI, 2013. English. ⟨NNT : ⟩. ⟨tel-00925271⟩



Record views


Files downloads