On index calculus algorithms for subfield curves

DOI10.1007/978-3-030-81652-0_5MaRDI QIDQ832332zbMATH OpenOpenAlexFDO

Authors Steven D. Galbraith, Robert Granger, Simon-Philipp Merz, Christophe Petit

Publication date 25 March 2022

Full work available at URL http://pure-oai.bham.ac.uk/ws/files/104974339/On_Index_Calculus_Algorithms_for_Subfield_Curves.pdf

zbMATH Keywords

Koblitz curveselliptic curve discrete logarithm problem

Mathematics Subject Classification ID

Cryptography (94A60) Elliptic curves over local fields (11G07) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Recommendations

• Improving the complexity of index calculus algorithms in elliptic curves over binary fields
• Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
• Using symmetries in the index calculus for elliptic curves discrete logarithm
• Quasi-subfield polynomials and the elliptic curve discrete logarithm problem
• Elliptic curve discrete logarithm problem over small degree extension fields

Cites work

• scientific article; zbMATH DE number 1617935 (Why is no real title available?)
• scientific article; zbMATH DE number 3948147 (Why is no real title available?)
• scientific article; zbMATH DE number 1304118 (Why is no real title available?)
• scientific article; zbMATH DE number 2151220 (Why is no real title available?)
• A new efficient algorithm for computing Gröbner bases (F₄)
• An algorithm for solving the discrete log problem on hyperelliptic curves
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Elliptic Curve Cryptosystems
• Elliptic curve cryptosystems over small fields of odd characteristic
• Elliptic curve discrete logarithm problem over small degree extension fields
• Galois invariant smoothness basis
• Improvement of Faugère et al.'s method to solve ECDLP
• Improving the complexity of index calculus algorithms in elliptic curves over binary fields
• Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
• Index calculus in the trace zero variety
• Kangaroos, monopoly and discrete logarithms
• Last fall degree, HFE, and Weil descent attacks on ECDLP
• On polynomial systems arising from a Weil descent
• On the discrete logarithm problem in elliptic curves
• Parallel collision search with cryptanalytic applications
• Recent progress on the elliptic curve discrete logarithm problem
• Solving sparse linear equations over finite fields
• The Function Field Sieve in the Medium Prime Case
• The Probability of Relatively Prime Polynomials
• Using symmetries in the index calculus for elliptic curves discrete logarithm

Cited in

(8)

• Quasi-subfield polynomials and the elliptic curve discrete logarithm problem
• Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation
• Performance analysis of index calculus method
• Complexity bounds on Semaev's naive index calculus method for ECDLP
• Improving the complexity of index calculus algorithms in elliptic curves over binary fields
• Using symmetries in the index calculus for elliptic curves discrete logarithm
• A SAT-Based Approach for Index Calculus on Binary Elliptic Curves
• Elliptic curve discrete logarithm problem over small degree extension fields

This page was built for publication: On index calculus algorithms for subfield curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832332)