Summation polynomial algorithms for elliptic curves in characteristic two
DOI10.1007/978-3-319-13039-2_24zbMATH Open1337.94036DBLPconf/indocrypt/GalbraithG14OpenAlexW2103531195WikidataQ61914016 ScholiaQ61914016MaRDI QIDQ2945401FDOQ2945401
Authors: 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
Recommendations
- Recent progress on the elliptic curve discrete logarithm problem
- Solving the elliptic curve discrete logarithm problem using Semaev polynomials, Weil descent and Gröbner basis methods -- an experimental study
- Dismantlability, Connectedness, and Mixing in Relational Structures
- On the discrete logarithm problem for prime-field elliptic curves
- Improving the complexity of index calculus algorithms in elliptic curves over binary fields
Cryptography (94A60) Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- On the discrete logarithm problem in class groups of curves
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Algebraic Cryptanalysis of the Data Encryption Standard
- Information and Communications Security
- Hybrid approach for solving multivariate systems over finite fields
- On the discrete logarithm problem in elliptic curves. II
- Cover and decomposition index calculus on elliptic curves made practical. Application to a previously unreachable curve over \(\mathbb{F}_{p^6}\)
- Improving the complexity of index calculus algorithms in elliptic curves over binary fields
- On polynomial systems arising from a Weil descent
- Constructive and destructive facets of Weil descent on elliptic curves
- Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
- On the discrete logarithm problem in elliptic curves
- Using symmetries in the index calculus for elliptic curves discrete logarithm
- Solving the elliptic curve discrete logarithm problem using Semaev polynomials, Weil descent and Gröbner basis methods -- an experimental study
- Improvement of Faugère et al.'s method to solve ECDLP
- Symmetrized summation polynomials: using small order torsion points to speed up elliptic curve index calculus
- Information Security and Privacy
Cited In (12)
- Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation
- Quasi-subfield polynomials and the elliptic curve discrete logarithm problem
- Dismantlability, Connectedness, and Mixing in Relational Structures
- Koblitz curves over quadratic fields
- Recent progress on the elliptic curve discrete logarithm problem
- Computing the characteristic polynomials of a class of hyperelliptic curves for cryptographic applications
- Logical cryptanalysis with WDSat
- The generalized Weil pairing and the discrete logarithm problem on elliptic curves
- The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic
- A SAT-Based Approach for Index Calculus on Binary Elliptic Curves
- On the discrete logarithm problem for prime-field elliptic curves
- Symmetrized summation polynomials: using small order torsion points to speed up elliptic curve index calculus
This page was built for publication: Summation polynomial algorithms for elliptic curves in characteristic two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945401)
