Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2019

Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms

Résumé

Elliptic bases, introduced by Couveignes and Lercier in 2009, give an elegant way of representing finite field extensions. A natural question which seems to have been considered independently by several groups is to use this representation as a starting point for small characteristic finite field discrete logarithm algorithms. This idea has been recently proposed by two groups working on it, in order to achieve provable quasi-polynomial time for discrete logarithms in small characteristic finite fields. In this paper, we don't try to achieve a provable algorithm but, instead, investigate the practicality of heuristic algorithms based on elliptic bases. Our key idea, is to use a different model of the elliptic curve used for the elliptic basis that allows for a relatively simple adaptation of the techniques used with former Frobenius representation algorithms. We haven't performed any record computation with this new method but our experiments with the field F 3 1345 indicate that switching to elliptic representations might be possible with performances comparable to the current best practical methods.
Fichier principal
Vignette du fichier
AlgoECdlog_enligne.pdf (366.2 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02173688 , version 1 (04-07-2019)
hal-02173688 , version 2 (24-10-2022)

Identifiants

Citer

Antoine Joux, Cécile Pierrot. Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms. 2019. ⟨hal-02173688v1⟩

Collections

UNIV-PARIS7 USPC
245 Consultations
158 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More