Improving ECDLP Computation in Characteristic 2

DOI10.1007/978-3-030-42921-8_32zbMath1500.94060OpenAlexW3014200691MaRDI QIDQ5040425

Fangguo Zhang, Ping Wang, Haibo Tian, Zhijie Liu

Publication date: 14 October 2022

Published in: Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-42921-8_32

zbMATH Keywords

elliptic curvesdiscrete logarithmpoint halvingparallelized rho method

Mathematics Subject Classification ID

Cryptography (94A60)

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
• Speeding up elliptic curve discrete logarithm computations with point halving
• On random walks for Pollard's rho method
• The Arithmetic of Elliptic Curves
• Elliptic Curve Cryptosystems
• New directions in cryptography
• Monte Carlo Methods for Index Computation (mod p)
• Probability Distributions Related to Random Mappings

This page was built for publication: Improving ECDLP Computation in Characteristic 2