Complexity bounds on Semaev's naive index calculus method for ECDLP
From MaRDI portal
Publication:2025337
DOI10.1515/jmc-2019-0029zbMath1464.94054OpenAlexW3094804166MaRDI QIDQ2025337
Masaya Yasuda, Yasushi Takahashi, Jun Kogure, Kazuhiro Yokoyama
Publication date: 12 May 2021
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jmc-2019-0029
Cryptography (94A60) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational hardness of IFP and ECDLP
- Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
- On QE algorithms over an algebraically closed field based on comprehensive Gröbner systems
- Recent progress on the elliptic curve discrete logarithm problem
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- The discrete logarithm problem on elliptic curves of trace one
- A survey on signature-based algorithms for computing Gröbner bases
- On the discrete logarithm problem for prime-field elliptic curves
- Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction
- Quasi-subfield polynomials and the elliptic curve discrete logarithm problem
- Solving the Discrete Logarithm of a 113-Bit Koblitz Curve with an FPGA Cluster
- Algebraic Approaches for the Elliptic Curve Discrete Logarithm Problem over Prime Fields
- Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
- On the discrete logarithm problem in elliptic curves
- Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP
- Elliptic Curve Cryptosystems
- A method for obtaining digital signatures and public-key cryptosystems
- Monte Carlo Methods for Index Computation (mod p)
- 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 𝑝
- On Polynomial Systems Arising from a Weil Descent
- Dimension-Dependent Upper Bounds for Gröbner Bases
- A Tropical F5 Algorithm
- On Affine Tropical F5 Algorithms
- Ideals, Varieties, and Algorithms
- Symmetrized Summation Polynomials: Using Small Order Torsion Points to Speed Up Elliptic Curve Index Calculus
- Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman
- Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation
