On the discrete logarithm problem for prime-field elliptic curves
From MaRDI portal
Publication:1747918
DOI10.1016/j.ffa.2018.01.009zbMath1421.11103OpenAlexW2789488647MaRDI QIDQ1747918
Federico Pintore, Alessandro Amadori, Massimiliano Sala
Publication date: 27 April 2018
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11572/202653
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Number-theoretic algorithms; complexity (11Y16) Elliptic curves (14H52) Curves over finite and local fields (11G20) Finite ground fields in algebraic geometry (14G15) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items
Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation, Complexity bounds on Semaev's naive index calculus method for ECDLP
Cites Work
- Using symmetries in the index calculus for elliptic curves discrete logarithm
- Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
- Recent progress on the elliptic curve discrete logarithm problem
- Elliptic curve discrete logarithm problem over small degree extension fields
- Algebraic Approaches for the Elliptic Curve Discrete Logarithm Problem over Prime Fields
- Solving the Elliptic Curve Discrete Logarithm Problem Using Semaev Polynomials, Weil Descent and Gröbner Basis Methods – An Experimental Study
- Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
- Summation Polynomial Algorithms for Elliptic Curves in Characteristic Two
- On the discrete logarithm problem in elliptic curves
- Improvement of Faugère et al.’s Method to Solve ECDLP
- Elliptic Curve Cryptosystems
- Monte Carlo Methods for Index Computation (mod p)
- Reducing elliptic curve logarithms to logarithms in a finite field
- On Polynomial Systems Arising from a Weil Descent
- Symmetrized Summation Polynomials: Using Small Order Torsion Points to Speed Up Elliptic Curve Index Calculus