Constructive and destructive facets of Weil descent on elliptic curves

DOI10.1007/s00145-001-0011-xzbMath0996.94036OpenAlexW2084836129MaRDI QIDQ1596367

Nigel P. Smart, Pierrick Gaudry, Florian Hess

Publication date: 21 May 2002

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00512763/file/weildesc_vZ.pdf

zbMATH Keywords

hyperelliptic curveJacobianelliptic curvediscrete logarithm problemcryptanalytic attacksWeil descenthyperelliptic cryptosystems

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Elliptic curves over local fields (11G07)

Related Items (51)

Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves ⋮ Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP ⋮ Efficient software-implementation of finite fields with applications to cryptography ⋮ Fiat-Shamir and correlation intractability from strong KDM-secure encryption ⋮ Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree ⋮ Generalising the GHS Attack on the Elliptic Curve Discrete Logarithm Problem ⋮ On the multi-user security of short Schnorr signatures with preprocessing ⋮ Ordinary elliptic curves of high rank over \(\bar {\mathbb F}_{p}(x)\) with constant \(j\)-invariant. II ⋮ Summation Polynomial Algorithms for Elliptic Curves in Characteristic Two ⋮ Improved Sieving on Algebraic Curves ⋮ Field extensions and index calculus on algebraic curves ⋮ Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves ⋮ Index calculus in the trace zero variety ⋮ Traces of the group law on the Kummer surface of a curve of genus 2 in characteristic 2 ⋮ Cover attacks for elliptic curves over cubic extension fields ⋮ Elliptic curve cryptography: the serpentine course of a paradigm shift ⋮ Elliptic curve discrete logarithm problem over small degree extension fields ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ Montgomery Ladder for All Genus 2 Curves in Characteristic 2 ⋮ The generalized Rédei-matrix for function fields ⋮ A note on the kernel of group homomorphism of the Weil descent method ⋮ Constructing Isogenies on Extended Jacobi Quartic Curves ⋮ Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: interplay of field arithmetic and explicit formulæ ⋮ Fault-based attack on Montgomery's ladder algorithm ⋮ An overview of the mathematical work of Fumiyuki Momose ⋮ 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 ⋮ ON BOUNDS FOR BALANCED EMBEDDING DEGREE ⋮ A new method for decomposition in the Jacobian of small genus hyperelliptic curves ⋮ An optimal representation for the trace zero subgroup ⋮ Algebraic curves and cryptography ⋮ Elliptic curve cryptosystems in the presence of permanent and transient faults ⋮ A comparison of different finite fields for elliptic curve cryptosystems ⋮ Koblitz curve cryptosystems ⋮ Can we beat the square root bound for ECDLP over \(\mathbb{F}_p^2\) via representation? ⋮ A generic approach to searching for Jacobians ⋮ On the asymptotic effectiveness of Weil descent attacks ⋮ Cover attacks for elliptic curves with cofactor two ⋮ Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem ⋮ Applications to cryptography of twisting commutative algebraic groups ⋮ Об алгоритмах построения изогений эллиптических кривых над конечными полями и их приложениях ⋮ Extractors for binary elliptic curves ⋮ Weil descent of Jacobians. ⋮ On the Security of Pairing-Friendly Abelian Varieties over Non-prime Fields ⋮ Faster Halvings in Genus 2 ⋮ Using abelian varieties to improve pairing-based cryptography ⋮ Koblitz curves over quadratic fields ⋮ Curves, Jacobians, and cryptography ⋮ Point compression for the trace zero subgroup over a small degree extension field ⋮ Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields ⋮ Hyper-and-elliptic-curve cryptography

Cites Work

• Algebraic function fields and codes
• A general framework for subexponential discrete logarithm algorithms
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Computing in the Jacobian of a Hyperelliptic Curve
• Computing discrete logarithms in real quadratic congruence function fields of large genus
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Constructive and destructive facets of Weil descent on elliptic curves