Speeding up elliptic curve discrete logarithm computations with point halving

DOI10.1007/s10623-011-9599-5zbMath1305.11114MaRDI QIDQ1943980

Fangguo Zhang, Ping Wang

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

zbMATH Keywords

random walk; Pollard rho method; elliptic curve discrete logarithm; point halving

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

11Y16: Number-theoretic algorithms; complexity

11G20: Curves over finite and local fields

14Q20: Effectivity, complexity and computational aspects of algebraic geometry

Related Items

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