Finding secure curves with the Satoh-FGH algorithm and an early-abort strategy - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2000

Finding secure curves with the Satoh-FGH algorithm and an early-abort strategy

Abstract

The use of elliptic curves in cryptography relies on the ability to count the number of points on a given curve. Before 1999, the SEA algorithm was the only efficient method known for random curves. Then Satoh proposed a new algorithm based on the canonical p-adic lift of the curve for p>=5. In an earlier paper, the authors extended Satoh's method to the case of characteristics two and three. This paper presents an implementation of the Satoh-FGH algorithm and its application to the problem of finding curves suitable for cryptography. By combining Satoh-FGH and an early-abort strategy based on SEA, we are able to find secure random curves in characteristic two in much less time than previously reported. In particular we can generate curves widely considered to be as secure as RSA-1024 in less than one minute each on a fast workstation.
Fichier principal
Vignette du fichier
euro01.pdf (243.57 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00514426 , version 1 (02-09-2010)

Identifiers

Cite

Mireille Fouquet, Pierrick Gaudry, Robert Harley. Finding secure curves with the Satoh-FGH algorithm and an early-abort strategy. Eurocrypt, 2001, Innsbruck, Austria. pp.14-29, ⟨10.1007/3-540-44987-6_2⟩. ⟨inria-00514426⟩
465 View
142 Download

Altmetric

Share

Gmail Facebook X LinkedIn More