Elliptic curve discrete logarithm problem over small degree extension fields
From MaRDI portal
Publication:1946599
DOI10.1007/s00145-011-9116-zzbMath1291.94107OpenAlexW2170644019MaRDI QIDQ1946599
Publication date: 15 April 2013
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-011-9116-z
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items
On index calculus algorithms for subfield curves, Semi-Regular Sequences and Other Random Systems of Equations, The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic, Field extensions and index calculus on algebraic curves, 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, Using symmetries in the index calculus for elliptic curves discrete logarithm, On the discrete logarithm problem for prime-field elliptic curves, Improvement of FPPR method to solve ECDLP, Point compression for the trace zero subgroup over a small degree extension field, Elliptic curves over a nonlocal ring 𝔽2d[𝜀,𝜀2 = 𝜀]
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases
- Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
- On an installation of Buchberger's algorithm
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- The discrete logarithm problem on elliptic curves of trace one
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Solving a system of algebraic equations with symmetries
- The Magma algebra system. I: The user language
- Kangaroos, monopoly and discrete logarithms
- Constructive and destructive facets of Weil descent on elliptic curves
- The Weil pairing, and its efficient calculation
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- Algebraic Cryptanalysis of Curry and Flurry Using Correlated Messages
- On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields
- A Variant of the F4 Algorithm
- On the discrete logarithm problem in elliptic curves
- Hybrid approach for solving multivariate systems over finite fields
- A double large prime variation for small genus hyperelliptic index calculus
- Another look at non-standard discrete log and Diffie-Hellman problems
- Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms
- Elliptic Curve Cryptosystems
- New directions in cryptography
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Monte Carlo Methods for Index Computation (mod p)
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- Reducing elliptic curve logarithms to logarithms in a finite field
- Evaluation of discrete logarithms in a group of 𝑝-torsion points of an elliptic curve in characteristic 𝑝
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Advances in Cryptology - ASIACRYPT 2003
