Elliptic curve cryptography: the serpentine course of a paradigm shift

DOI10.1016/j.jnt.2009.01.006zbMath1213.94117OpenAlexW2037497641WikidataQ56854180 ScholiaQ56854180MaRDI QIDQ2430981

Neal Koblitz, Ann Hibner Koblitz, Alfred J. Menezes

Publication date: 8 April 2011

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jnt.2009.01.006

zbMATH Keywords

cryptographyelliptic curvepublic keysocial construction of sciencesocial construction of technology

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Applications to coding theory and cryptography of arithmetic geometry (14G50) Sociology (and profession) of mathematics (01A80)

Related Items (6)

Improved algorithm for the isogeny problem for ordinary elliptic curves ⋮ Isolated elliptic curves and the MOV attack ⋮ Supply chain financing scheme based on blockchain technology from a business application perspective ⋮ Huff’s Model for Elliptic Curves ⋮ Super-Isolated Elliptic Curves and Abelian Surfaces in Cryptography ⋮ Super-isolated abelian varieties

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
• The Diffie-Hellman problem and generalization of Verheul's theorem
• Another look at generic groups
• Another look at ``provable security
• Index calculus in class groups of non-hyperelliptic curves of genus three
• Factoring integers with elliptic curves
• Hyperelliptic cryptosystems
• The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
• Fast multiplication on elliptic curves over small fields of characteristic two
• Constructive and destructive facets of Weil descent on elliptic curves
• Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
• The Weil pairing, and its efficient calculation
• The Xedni calculus and the elliptic curve discrete logarithm problem
• Analysis of the Xedni calculus attack
• Efficient arithmetic on Koblitz curves
• Short signatures without random oracles and the SDH assumption in bilinear groups
• Cryptographic implications of Hess' generalized GHS attack
• Fast evaluation of logarithms in fields of characteristic two
• A double large prime variation for small genus hyperelliptic index calculus
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• The number field sieve for integers of low weight
• Security Analysis of the Strong Diffie-Hellman Problem
• Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography
• Another look at non-standard discrete log and Diffie-Hellman problems
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Elliptic Curve Cryptosystems
• New directions in cryptography
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Monte Carlo Methods for Index Computation (mod p)
• Constructing Isogenies between Elliptic Curves Over Finite Fields
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• Reducing elliptic curve logarithms to logarithms in a finite field
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Improving the parallelized Pollard lambda search on anomalous binary curves
• Identity-Based Encryption from the Weil Pairing
• Generalising the GHS Attack on the Elliptic Curve Discrete Logarithm Problem
• Easy Decision Diffie-Hellman Groups
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
• Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?
• Another Look at “Provable Security”. II
• Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves
• Cryptography and Coding
• Algorithmic Number Theory
• Topics in Cryptology – CT-RSA 2004

This page was built for publication: Elliptic curve cryptography: the serpentine course of a paradigm shift