scholarly journals Faster individual discrete logarithms in finite fields of composite extension degree

2018 ◽  
Vol 88 (317) ◽  
pp. 1273-1301 ◽  
Author(s):  
Aurore Guillevic
Keyword(s):  
Finite Fields ◽  
Discrete Logarithms ◽  
Extension Degree

scholarly journals Function Field Sieve Method for Discrete Logarithms over Finite Fields

1999 ◽  
Vol 151 (1-2) ◽  
pp. 5-16 ◽  
Author(s):  
Leonard M. Adleman ◽  
Ming-Deh A. Huang
Keyword(s):  
Finite Fields ◽  
Function Field ◽  
Sieve Method ◽  
Discrete Logarithms

scholarly journals Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree

2002 ◽  
Vol 5 ◽  
pp. 127-174 ◽  
Author(s):  
Markus Maurer ◽  
Alfred Menezes ◽  
Edlyn Teske
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curves ◽  
Finite Fields ◽  
Discrete Logarithm ◽  
Discrete Logarithm Problem ◽  
Signature Scheme ◽  
Extension Degree ◽  
Characteristic Two ◽  
Weil Descent

AbstractIn this paper, the authors analyze the Gaudry-Hess-Smart (GHS) Weil descent attack on the elliptic curve discrete logarithm problem (ECDLP) for elliptic curves defined over characteristic two finite fields of composite extension degree. For each such field F2N, where N is in [100,600], elliptic curve parameters are identified such that: (i) there should exist a cryptographically interesting elliptic curve E over F2N with these parameters; and (ii) the GHS attack is more efficient for solving the ECDLP in E(F2N) than for solving the ECDLP on any other cryptographically interesting elliptic curve over F2N. The feasibility of the GHS attack on the specific elliptic curves is examined over F2176, F2208, F2272, F2304 and F2368, which are provided as examples in the ANSI X9.62 standard for the elliptic curve signature scheme ECDSA. Finally, several concrete instances are provided of the ECDLP over F2N, N composite, of increasing difficulty; these resist all previously known attacks, but are within reach of the GHS attack.

scholarly journals Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields

2018 ◽  
Vol 12 (4) ◽  
pp. 741-759
Author(s):  
Gora Adj ◽  
◽  
Isaac Canales-Martínez ◽  
Nareli Cruz-Cortés ◽  
Alfred Menezes ◽  
...  
Keyword(s):  
Finite Fields ◽  
Discrete Logarithms
Sign in / Sign up

Export Citation Format

Share Document