Computing cardinalities of Q-curve reductions over finite fields - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2016

Computing cardinalities of Q-curve reductions over finite fields

Résumé

We present a specialized point-counting algorithm for a class of elliptic curves over F_{p^2} that includes reductions of quadratic Q-curves modulo inert primes and, more generally, any elliptic curve over F_{p^2} with a low-degree isogeny to its Galois conjugate curve. These curves have interesting cryptographic applications. Our algorithm is a variant of the Schoof–Elkies–Atkin (SEA) algorithm, but with a new, lower-degree endomorphism in place of Frobenius. While it has the same asymptotic asymptotic complexity as SEA, our algorithm is much faster in practice.
Fichier principal
Vignette du fichier
qcsea.pdf (221.06 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01320388 , version 1 (23-05-2016)
hal-01320388 , version 2 (06-06-2016)
hal-01320388 , version 3 (17-06-2016)

Identifiants

Citer

François Morain, Charlotte Scribot, Benjamin Smith. Computing cardinalities of Q-curve reductions over finite fields. 2016. ⟨hal-01320388v1⟩
393 Consultations
213 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More