Improving the parallelized Pollard lambda search on anomalous binary curves

DOI10.1090/S0025-5718-99-01119-9zbMATH Open1101.14325MaRDI QIDQ4501048FDOQ4501048

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

Publication date: 3 September 2000

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

Recommendations

• An algorithm for DLP on anomalous elliptic curves over \(\mathbb F_p\)
• Speeding up elliptic curve discrete logarithm computations with point halving
• scientific article; zbMATH DE number 1304118
• scientific article; zbMATH DE number 2165762
• Improving ECDLP computation in characteristic 2

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Parallel collision search with cryptanalytic applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (26)

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

This page was built for publication: Improving the parallelized Pollard lambda search on anomalous binary curves

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