scientific article; zbMATH DE number 1304118

zbMath1025.94511MaRDI QIDQ4250816

Michael J. Wiener, Robert J. Zuccherato

Publication date: 17 June 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

attackselliptic curve cryptosystemsKoblitz curveselliptic curve discrete logarithm problem

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (30)

Fast cryptography in genus 2 ⋮ On index calculus algorithms for subfield curves ⋮ Cycle structure of iterating Rédei functions ⋮ 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 ⋮ Unnamed Item ⋮ 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 ⋮ Endomorphisms for faster elliptic curve cryptography on a large class of curves ⋮ Computing elliptic curve discrete logarithms with the negation map ⋮ ON THE COMPLEXITY OF DISCRETE LOGARITHM PROBLEM IN AN INTERVAL IN A FINITE CYCLIC GROUP WITH EFFICIENT INVERSION ⋮ О сложности двупараметрической задачи дискретного логарифмирования в конечной циклической группе с эффективным автоморфизмом ⋮ Computational hardness of IFP and ECDLP ⋮ Koblitz curve cryptosystems ⋮ 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 ⋮ Modified Gaudry-Schost algorithm for the two-dimensional discrete logarithm problem ⋮ Improved classical cryptanalysis of SIKE in practice ⋮ On the heuristic of approximating polynomials over finite fields by random mappings ⋮ Koblitz curves over quadratic fields ⋮ Improving the parallelized Pollard lambda search on anomalous binary curves ⋮ A note on the \(x\)-coordinate of points on an elliptic curve in characteristic two

This page was built for publication: