Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-18T22:13:12.381Z Has data issue: false hasContentIssue false

Generalising the GHS Attack on the Elliptic Curve Discrete Logarithm Problem

Published online by Cambridge University Press:  01 February 2010

F. Hess
Affiliation:
Technical University of Berlin, Faculty II- Institute of Mathematics, MA8-1 Straße des 17. Juni 136, 10623 Berlin, Germany, hess@math.tu-berlin.de, http://www.math.tu-berlin.de/~hess

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The Weil descent construction of the GHS attack on the elliptic curve discrete logarithm problem (ECDLP) is generalised in this paper, to arbitrary Artin-Schreier extensions. A formula is given for the characteristic polynomial of Frobenius for the curves thus obtained, as well as a proof that the large cyclic factor of the input elliptic curve is not contained in the kernel of the composition of the conorm and norm maps. As an application, the number of elliptic curves that succumb to the basic GHS attack is considerably increased, thereby further weakening curves over GF2155.

Other possible extensions or variations of the GHS attack are discussed, leading to the conclusion that they are unlikely to yield further improvements.

Information

Type
Research Article
Copyright
Copyright © London Mathematical Society 2004