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

DOI10.1016/J.CAM.2012.03.019MaRDI QIDQ442714zbMATH OpenOpenAlexFDO

Authors 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) Number-theoretic algorithms; complexity (11Y16) Cryptography (94A60)

Recommendations

• Subset-Restricted Random Walks for Pollard rho Method on ${\mathbf{F}_{p^m}}$
• scientific article; zbMATH DE number 1186971
• Accelerating Pollard's rho algorithm on finite fields
• Speeding up elliptic curve discrete logarithm computations with point halving
• An efficient collision detection method for computing discrete logarithms with Pollard's rho

Cites work

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

Cited in

(2)

• Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
• An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442714)