Improving the parallelized Pollard lambda search on anomalous binary curves

DOI10.1090/S0025-5718-99-01119-9zbMath1101.14325MaRDI QIDQ4501048

Scott A. Vanstone, Robert P. Gallant, Robert J. Lambert

Publication date: 3 September 2000

Published in: Mathematics of Computation (Search for Journal in Brave)

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Computational aspects of algebraic curves (14Q05) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items

Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree ⋮ Improved algorithm for the isogeny problem for ordinary elliptic curves ⋮ Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm ⋮ Rédei Actions on Finite Fields and Multiplication Map in Cyclic Group ⋮ A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity ⋮ Guest editorial: Special issue in honor of Scott A. Vanstone ⋮ An efficient collision detection method for computing discrete logarithms with Pollard's rho ⋮ Speeding up elliptic curve discrete logarithm computations with point halving ⋮ Elliptic curve cryptography: the serpentine course of a paradigm shift ⋮ Accelerating Pollard's rho algorithm on finite fields ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ Improved Pollard rho method for computing discrete logarithms over finite extension fields ⋮ On random walks for Pollard's rho method ⋮ Endomorphisms for faster elliptic curve cryptography on a large class of curves ⋮ Computing elliptic curve discrete logarithms with the negation map ⋮ Fault-based attack on Montgomery's ladder algorithm ⋮ Computational hardness of IFP and ECDLP ⋮ Speeding Up the Pollard Rho Method on Prime Fields ⋮ Exponentiation in Pairing-Friendly Groups Using Homomorphisms ⋮ A Result on the Distribution of Quadratic Residues with Applications to Elliptic Curve Cryptography ⋮ Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves ⋮ Koblitz curves over quadratic fields ⋮ A note on the \(x\)-coordinate of points on an elliptic curve in characteristic two

Cites Work

• Parallel collision search with cryptanalytic applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item