Speeding up elliptic curve discrete logarithm computations with point halving
From MaRDI portal
Publication:1943980
DOI10.1007/S10623-011-9599-5zbMath1305.11114OpenAlexW2041584779MaRDI QIDQ1943980
Publication date: 3 April 2013
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-011-9599-5
Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Curves over finite and local fields (11G20) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)
Related Items (2)
Improving ECDLP Computation in Characteristic 2 ⋮ Recent progress on the elliptic curve discrete logarithm problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel collision search with cryptanalytic applications
- A method of solution of the problem of taking the discrete logarithm on an elliptic curve by division of points by two
- On random walks for Pollard's rho method
- On the Correct Use of the Negation Map in the Pollard rho Method
- Batch Binary Edwards
- A Monte Carlo Factoring Algorithm With Linear Storage
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- Elliptic Curve Cryptosystems
- New directions in cryptography
- Factorization of the Eighth Fermat Number
- A monte carlo method for factorization
- Monte Carlo Methods for Index Computation (mod p)
- Improving the parallelized Pollard lambda search on anomalous binary curves
- On the Use of the Negation Map in the Pollard Rho Method
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Probability Distributions Related to Random Mappings
This page was built for publication: Speeding up elliptic curve discrete logarithm computations with point halving