On index calculus algorithms for subfield curves
From MaRDI portal
Publication:832332
DOI10.1007/978-3-030-81652-0_5zbMATH Open1485.94086OpenAlexW3183990474MaRDI QIDQ832332FDOQ832332
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
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
Cryptography (94A60) Elliptic curves over local fields (11G07) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cites Work
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Title not available (Why is that?)
- An algorithm for solving the discrete log problem on hyperelliptic curves
- Title not available (Why is that?)
- Elliptic Curve Cryptosystems
- Title not available (Why is that?)
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Solving sparse linear equations over finite fields
- Parallel collision search with cryptanalytic applications
- Kangaroos, monopoly and discrete logarithms
- Elliptic curve cryptosystems over small fields of odd characteristic
- Improving the complexity of index calculus algorithms in elliptic curves over binary fields
- On polynomial systems arising from a Weil descent
- Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
- Elliptic curve discrete logarithm problem over small degree extension fields
- On the discrete logarithm problem in elliptic curves
- Galois invariant smoothness basis
- Using symmetries in the index calculus for elliptic curves discrete logarithm
- Index calculus in the trace zero variety
- Title not available (Why is that?)
- The Probability of Relatively Prime Polynomials
- Improvement of Faugère et al.’s Method to Solve ECDLP
- Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP
- The Function Field Sieve in the Medium Prime Case
- Recent progress on the elliptic curve discrete logarithm problem
Cited In (4)
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)