Generalising the GHS Attack on the Elliptic Curve Discrete Logarithm Problem

DOI10.1112/S146115700000108XzbMath1108.14302OpenAlexW1984772295MaRDI QIDQ4827628

Florian Hess

Publication date: 18 November 2004

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

Full work available at URL: http://www.lms.ac.uk/jcm/7/lms2003-007/

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Elliptic curves (14H52) Curves over finite and local fields (11G20) Finite ground fields in algebraic geometry (14G15) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (10)

Improved Top-Down Techniques in Differential Cryptanalysis ⋮ Elliptic curve cryptography: the serpentine course of a paradigm shift ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ The generalized Rédei-matrix for function fields ⋮ On implementation of GHS attack against elliptic curve cryptosystems over cubic extension fields of odd characteristic ⋮ Extending the GLS endomorphism to speed up GHS Weil descent using Magma ⋮ Algebraic curves and cryptography ⋮ Cryptographic implications of Hess' generalized GHS attack ⋮ Extractors for binary elliptic curves ⋮ Koblitz curves over quadratic fields

Cites Work

• Constructive and destructive facets of Weil descent on elliptic curves
• Computing Riemann-Roch spaces in algebraic function fields and related topics.
• Elementary abelian \(p\)-extensions of algebraic function 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
• Progress in cryptology - INDOCRYPT 2001. 2nd international conference on cryptology in India, Chennai, India, December 16--20, 2001. Proceedings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalising the GHS Attack on the Elliptic Curve Discrete Logarithm Problem