Publication:4250816

zbMath1025.94511MaRDI QIDQ4250816

Michael J. Wiener, Robert J. Zuccherato

Publication date: 17 June 1999

zbMATH Keywords

attacks; elliptic curve cryptosystems; Koblitz curves; elliptic curve discrete logarithm problem

Mathematics Subject Classification ID

94A60: Cryptography

14G50: Applications to coding theory and cryptography of arithmetic geometry

Related Items

Improving the parallelized Pollard lambda search on anomalous binary curves, Unnamed Item, ON THE COMPLEXITY OF DISCRETE LOGARITHM PROBLEM IN AN INTERVAL IN A FINITE CYCLIC GROUP WITH EFFICIENT INVERSION, О сложности двупараметрической задачи дискретного логарифмирования в конечной циклической группе с эффективным автоморфизмом, A Result on the Distribution of Quadratic Residues with Applications to Elliptic Curve Cryptography, Fast cryptography in genus 2, 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, On index calculus algorithms for subfield curves, Recent progress on the elliptic curve discrete logarithm problem, A note on the \(x\)-coordinate of points on an elliptic curve in characteristic two, Koblitz curve cryptosystems, Speeding up elliptic curve discrete logarithm computations with point halving, Improved classical cryptanalysis of SIKE in practice, Koblitz curves over quadratic fields, Cycle structure of iterating Rédei functions, 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 the heuristic of approximating polynomials over finite fields by random mappings, Rédei Actions on Finite Fields and Multiplication Map in Cyclic Group, Modified Gaudry-Schost algorithm for the two-dimensional discrete logarithm problem, 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