Solving the Elliptic Curve Discrete Logarithm Problem Using Semaev Polynomials, Weil Descent and Gröbner Basis Methods – An Experimental Study

DOI10.1007/978-3-642-42001-6_7zbMath1320.11125OpenAlexW2252701011MaRDI QIDQ2867250

Michael Shantz, Edlyn Teske

Publication date: 10 December 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-42001-6_7

Mathematics Subject Classification ID

Cryptography (94A60) 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 (7)

A SAT-Based Approach for Index Calculus on Binary Elliptic Curves ⋮ Summation Polynomial Algorithms for Elliptic Curves in Characteristic Two ⋮ Quasi-subfield polynomials and the elliptic curve discrete logarithm problem ⋮ Index calculus in the trace zero variety ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ On the discrete logarithm problem for prime-field elliptic curves ⋮ Improvement of FPPR method to solve ECDLP

This page was built for publication: Solving the Elliptic Curve Discrete Logarithm Problem Using Semaev Polynomials, Weil Descent and Gröbner Basis Methods – An Experimental Study