Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields

DOI10.1007/978-3-642-29011-4_4zbMath1290.94070OpenAlexW1785867541WikidataQ62047260 ScholiaQ62047260MaRDI QIDQ2894399

Ludovic Perret, Guénaël Renault, Jean-Charles Faugère, Christophe Petit

Publication date: 29 June 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-29011-4_4

zbMATH Keywords

elliptic curve cryptographypolynomial system solvingindex calculus

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

On index calculus algorithms for subfield curves, A SAT-Based Approach for Index Calculus on Binary Elliptic Curves, Summation Polynomial Algorithms for Elliptic Curves in Characteristic Two, First fall degree and Weil descent, Quasi-subfield polynomials and the elliptic curve discrete logarithm problem, Index calculus in the trace zero variety, Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation, Recent progress on the elliptic curve discrete logarithm problem, Computational hardness of IFP and ECDLP, On the discrete logarithm problem for prime-field elliptic curves, Complexity bounds on Semaev's naive index calculus method for ECDLP, Improvement of FPPR method to solve ECDLP, Koblitz curves over quadratic fields, Finding roots in with the successive resultants algorithm

Uses Software

• FGb