Finding Good Random Elliptic Curves for Cryptosystems Defined Over $GF(2^n)$ - Département d'informatique Accéder directement au contenu
Communication Dans Un Congrès Année : 1997

Finding Good Random Elliptic Curves for Cryptosystems Defined Over $GF(2^n)$

Résumé

One of the main difficulties for implementing cryptographic schemes based on elliptic curves defined over finite fields is the necessary computation of the cardinality of these curves. In the case of finite fields $GF(2^n)$, recent theoretical breakthroughs yield a significant speed up of the computations. Once described some of these ideas in the first part of this paper, we show that our current implementation runs from 2 up to 10 times faster than what was done previously. In the second part, we exhibit a slight change of Schoof's algorithm to choose curves with a number of points ``nearly'' prime and so construct cryptosystems based on random elliptic curves instead of specific curves as it used to be.

Dates et versions

hal-01102043 , version 1 (12-01-2015)

Identifiants

Citer

Reynald Lercier. Finding Good Random Elliptic Curves for Cryptosystems Defined Over $GF(2^n)$. EUROCRYPT '97, May 1997, Konstanz, Germany. pp.379-392, ⟨10.1007/3-540-69053-0_26⟩. ⟨hal-01102043⟩
82 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More