A comparison and a combination of SST and AGM algorithms for counting points of elliptic curves in characteristic 2 - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2002

A comparison and a combination of SST and AGM algorithms for counting points of elliptic curves in characteristic 2

Abstract

Since the first use of a p-adic method for counting points of elliptic curves, by Satoh in 1999, several variants of his algorithm have been proposed. In the current state, the AGM algorithm, proposed by Mestre is thought to be the fastest in practice, and the algorithm by Satoh­-Skjernaa­-Taguchi has the best asymptotic complexity but requires precomputations. We present an amelioration of the SST algorithm, borrowing ideas from the AGM. We make a precise comparison between this modified SST algorithm and the AGM, thus demonstrating that the former is faster by a significant factor, even for small cryptographic sizes.
Fichier principal
Vignette du fichier
sstagm.pdf (179.52 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00514137 , version 1 (01-09-2010)

Identifiers

Cite

Pierrick Gaudry. A comparison and a combination of SST and AGM algorithms for counting points of elliptic curves in characteristic 2. Asiacrypt, 2002, Queenstown, New Zealand. pp.621-628, ⟨10.1007/3-540-36178-2_20⟩. ⟨inria-00514137⟩
187 View
228 Download

Altmetric

Share

Gmail Facebook X LinkedIn More