Improving the parallelized Pollard lambda search on anomalous binary curves
From MaRDI portal
Publication:4501048
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)
94A60: Cryptography
11Y16: Number-theoretic algorithms; complexity
14Q05: Computational aspects of algebraic curves
14G50: Applications to coding theory and cryptography of arithmetic geometry
Related Items
Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree, A Result on the Distribution of Quadratic Residues with Applications to Elliptic Curve Cryptography, Improved algorithm for the isogeny problem for ordinary elliptic curves, 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, Endomorphisms for faster elliptic curve cryptography on a large class of curves, Computing elliptic curve discrete logarithms with the negation map, Computational hardness of IFP and ECDLP, Fault-based attack on Montgomery's ladder algorithm, Guest editorial: Special issue in honor of Scott A. Vanstone, Recent progress on the elliptic curve discrete logarithm problem, A note on the \(x\)-coordinate of points on an elliptic curve in characteristic two, Speeding up elliptic curve discrete logarithm computations with point halving, Koblitz curves over quadratic fields, Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm, A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity, Elliptic curve cryptography: the serpentine course of a paradigm shift, On random walks for Pollard's rho method, Rédei Actions on Finite Fields and Multiplication Map in Cyclic Group, Speeding Up the Pollard Rho Method on Prime Fields, Exponentiation in Pairing-Friendly Groups Using Homomorphisms, Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
Cites Work
