Improved Pollard rho method for computing discrete logarithms over finite extension fields

DOI10.1016/j.cam.2012.03.019zbMath1277.94042OpenAlexW2058130972MaRDI QIDQ442714

Fangguo Zhang, Ping Wang

Publication date: 3 August 2012

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2012.03.019

zbMATH Keywords

discrete logarithmnormal basis representationPollard rho method

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient signature generation by smart cards
• Parallel collision search with cryptanalytic applications
• Short signatures from the Weil pairing
• Subset-Restricted Random Walks for Pollard rho Method on ${\mathbf{F}_{p^m}}$
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Elliptic Curve Cryptosystems
• New directions in cryptography
• Factorization of the Eighth Fermat Number
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Monte Carlo Methods for Index Computation (mod p)
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• Reducing elliptic curve logarithms to logarithms in a finite field
• Improving the parallelized Pollard lambda search on anomalous binary curves
• Probability Distributions Related to Random Mappings

This page was built for publication: Improved Pollard rho method for computing discrete logarithms over finite extension fields