Summation Polynomial Algorithms for Elliptic Curves in Characteristic Two
From MaRDI portal
Publication:2945401
DOI10.1007/978-3-319-13039-2_24zbMath1337.94036OpenAlexW2103531195WikidataQ61914016 ScholiaQ61914016MaRDI QIDQ2945401
Steven D. Galbraith, Shishay W. Gebregiyorgis
Publication date: 10 September 2015
Published in: Progress in Cryptology -- INDOCRYPT 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-13039-2_24
Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)
Related Items (8)
A SAT-Based Approach for Index Calculus on Binary Elliptic Curves ⋮ The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic ⋮ Quasi-subfield polynomials and the elliptic curve discrete logarithm problem ⋮ Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ On the discrete logarithm problem for prime-field elliptic curves ⋮ Koblitz curves over quadratic fields ⋮ Logical cryptanalysis with WDSat
Cites Work
- On the discrete logarithm problem in elliptic curves. II
- 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
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Constructive and destructive facets of Weil descent on elliptic curves
- Solving the Elliptic Curve Discrete Logarithm Problem Using Semaev Polynomials, Weil Descent and Gröbner Basis Methods – An Experimental Study
- Cover and Decomposition Index Calculus on Elliptic Curves Made Practical
- Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
- On the discrete logarithm problem in elliptic curves
- On the discrete logarithm problem in class groups of curves
- Improvement of Faugère et al.’s Method to Solve ECDLP
- Hybrid approach for solving multivariate systems over finite fields
- On Polynomial Systems Arising from a Weil Descent
- Information Security and Privacy
- Symmetrized Summation Polynomials: Using Small Order Torsion Points to Speed Up Elliptic Curve Index Calculus
- Algebraic Cryptanalysis of the Data Encryption Standard
- Information and Communications Security
This page was built for publication: Summation Polynomial Algorithms for Elliptic Curves in Characteristic Two
