Using symmetries in the index calculus for elliptic curves discrete logarithm

DOI10.1007/s00145-013-9158-5zbMath1320.94063OpenAlexW2028957991MaRDI QIDQ484325

Pierrick Gaudry, Louise Huot, Jean-Charles Faugère, Guénaël Renault

Publication date: 7 January 2015

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-013-9158-5

zbMATH Keywords

elliptic curvesEdwards curvesECDLPGröbner basis with symmetriesindex calculusJacobi intersection curvespoint decomposition problem

Mathematics Subject Classification ID

Cryptography (94A60) Elliptic curves (14H52) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (9)

On index calculus algorithms for subfield 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 ⋮ Covariant algebra of the binary nonic and the binary decimic ⋮ Index calculus in the trace zero variety ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ Sparse FGLM algorithms ⋮ On the discrete logarithm problem for prime-field elliptic curves ⋮ On the complexity of computing Gröbner bases for weighted homogeneous systems

Uses Software

• FGb
• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
• Index calculus in class groups of non-hyperelliptic curves of genus three
• Hyperelliptic cryptosystems
• Some tapas of computer algebra
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• The Magma algebra system. I: The user language
• Sequences of numbers generated by addition in formal groups and new primality and factorization tests
• Elliptic curve discrete logarithm problem over small degree extension fields
• A general framework for subexponential discrete logarithm algorithms
• Modern Computer Algebra
• Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases
• On the complexity of computing gröbner bases for quasi-homogeneous systems
• On the discrete logarithm problem in elliptic curves
• On the discrete logarithm problem in class groups of curves
• Hybrid approach for solving multivariate systems over finite fields
• A double large prime variation for small genus hyperelliptic index calculus
• Twisted Edwards Curves
• Galois invariant smoothness basis
• Twisted Jacobi Intersections Curves
• Solving sparse linear equations over finite fields
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• Elliptic Curve Cryptosystems
• Monte Carlo Methods for Index Computation (mod p)
• Decomposition Attack for the Jacobian of a Hyperelliptic Curve over an Extension Field
• Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices
• Faster Addition and Doubling on Elliptic Curves
• A normal form for elliptic curves
• An L (1/3 + ε) Algorithm for the Discrete Logarithm Problem for Low Degree Curves
• FGb: A Library for Computing Gröbner Bases
• Finite Unitary Reflection Groups
• Invariants of Finite Groups Generated by Reflections
• Algorithmic Number Theory
• Algorithms in invariant theory
• Advances in Cryptology - ASIACRYPT 2003
• Reflection groups and invariant theory

This page was built for publication: Using symmetries in the index calculus for elliptic curves discrete logarithm