Analysis of the Weil Descent Attack of Gaudry, Hess and Smart

Authors:
Alfred Menezes;Minghua Qu
Affiliations:
-;-
Venue:
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Year:
2001

Citing 3
Cited 9

A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves

Mathematics of Computation
The Extended Euclidian Algorithm on Polynomials,and the Computational Efficiency of Hyperelliptic Cryptosystems

Designs, Codes and Cryptography
A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields

ANTS-I Proceedings of the First International Symposium on Algorithmic Number Theory

How Secure Are Elliptic Curves over Composite Extension Fields?

EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Speeding Up Point Multiplication on Hyperelliptic Curves with Efficiently-Computable Endomorphisms

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
A Secure Family of Composite Finite Fields Suitable for Fast Implementation of Elliptic Curve Cryptography

INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
Elliptic Curve Cryptosystems in the Presence of Permanent and Transient Faults

Designs, Codes and Cryptography
Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem

Journal of Symbolic Computation
The GHS attack revisited

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Redundant trinomials for finite fields of characteristic 2

ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
On partial lifting and the elliptic curve discrete logarithm problem

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Algebraic curves and cryptography

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We analyze the Weil descent attack of Gaudry, Hess and Smart [11] on the elliptic curve discrete logarithm problem for elliptic curves defined over finite fields of characteristic two.