Generalising the GHS Attack on the Elliptic Curve Discrete Logarithm Problem (Q4827628)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2116766
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalising the GHS Attack on the Elliptic Curve Discrete Logarithm Problem |
scientific article; zbMATH DE number 2116766 |
Statements
Generalising the GHS Attack on the Elliptic Curve Discrete Logarithm Problem (English)
0 references
18 November 2004
0 references
0 references
0.9375551342964172
0 references
0.9161581993103028
0 references
0.9123552441596984
0 references
0.9123552441596984
0 references
0.9062759280204772
0 references
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 \(\mathbb{F}_{2^{155}}\). Other possible extensions or variations of the GHS attack are discussed, leading to the conclusion that they are unlikely to yield further improvements.
0 references