Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation
From MaRDI portal
Publication:6162380
DOI10.1007/978-3-030-00434-7_19OpenAlexW2889309722MaRDI QIDQ6162380
Yasushi Takahashi, Unnamed Author, Masaya Yasuda, Momonari Kudo
Publication date: 28 June 2023
Published in: Cryptology and Network Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-00434-7_19
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Number-theoretic algorithms; complexity (11Y16) Curves over finite and local fields (11G20)
Related Items (1)
Cites Work
- 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
- 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
- Solving 114-bit ECDLP for a Barreto-Naehrig curve
- 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
- 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
- Summation Polynomial Algorithms for Elliptic Curves in Characteristic Two
- On the discrete logarithm problem in elliptic curves
- Characteristic-free bounds for the Castelnuovo–Mumford regularity
- Hybrid approach for solving multivariate systems over finite fields
- Factorization of a 768-Bit RSA Modulus
- The Arithmetic of Elliptic Curves
- 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 𝑝
- The Geometry of Syzygies
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
This page was built for publication: Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation
