scientific article; zbMATH DE number 1186971

MaRDI QIDQ3840196zbMATH OpenFDO

Authors Edlyn Teske

Publication date 1998

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1423/14230541.htm

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Speeding Up the Pollard Rho Method on Prime Fields
• On random walks for Pollard's rho method
• Speeding up elliptic curve discrete logarithm computations with point halving
• On random walks of Pollard's rho method for the ECDLP on Koblitz curves

Cited in

(23)

• Computing discrete logarithms with the parallelized kangaroo method.
• Speeding up elliptic curve discrete logarithm computations with point halving
• On computing the degree of a Chebyshev polynomial from its value
• Solving discrete logarithm problems faster with the aid of pre-computation
• A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity
• On random walks for Pollard's rho method
• The parallelized Pollard kangaroo method in real quadratic function fields
• Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields
• Structure computation and discrete logarithms in finite abelian \(p\)-groups
• Security Analysis of the Strong Diffie-Hellman Problem
• Speeding Up the Pollard Rho Method on Prime Fields
• An efficient collision detection method for computing discrete logarithms with Pollard's rho
• Accelerating Pollard's rho algorithm on finite fields
• Improved Pollard rho method for computing discrete logarithms over finite extension fields
• Improving the parallelized Pollard lambda search on anomalous binary curves
• Computing elliptic curve discrete logarithms with the negation map
• On the use of the negation map in the Pollard rho method
• Sequences with good correlation property based on depth and interleaving techniques
• Improving ECDLP computation in characteristic 2
• Computational hardness of IFP and ECDLP
• On improvements of ther-adding walk in a finite field of characteristic 2
• An iterative method based on Pohlig-Hellman and Pollard for computing discrete logarithm
• Discrete logarithm problems with auxiliary inputs

This page was built for publication:

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