Symmetrized Summation Polynomials: Using Small Order Torsion Points to Speed Up Elliptic Curve Index Calculus

DOI10.1007/978-3-642-55220-5_3zbMath1326.94092OpenAlexW114147481MaRDI QIDQ5418688

Guénaël Renault, Antoine Joux, Vanessa Vitse, Jean-Charles Faugère, Louise Huot

Publication date: 27 May 2014

Published in: Advances in Cryptology – EUROCRYPT 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-55220-5_3

zbMATH Keywords

decomposition methodelliptic curvesinvariant theoryECDLPindex calculusmultivariate polynomial systemsSemaev polynomials

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (7)

A SAT-Based Approach for Index Calculus on Binary Elliptic Curves ⋮ The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic ⋮ Summation Polynomial Algorithms for Elliptic Curves in Characteristic Two ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ On the discrete logarithm problem for prime-field elliptic curves ⋮ Complexity bounds on Semaev's naive index calculus method for ECDLP ⋮ High-degree Compression Functions on Alternative Models of Elliptic Curves and their Applications

Uses Software

• FGb

This page was built for publication: Symmetrized Summation Polynomials: Using Small Order Torsion Points to Speed Up Elliptic Curve Index Calculus