Improvements on the Discrete Logarithm Problem in GF(p)

Razvan Barbulescu 1
1 CARAMEL - Cryptology, Arithmetic: Hardware and Software
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
Abstract : This paper speeds up descrete logarithm algorithms in two ways. First we show how the Factorization Factory can be adapted to the discrete logarithm to drop the complexity from Lp(1/3,1.902) to Lp(1/3,1.639). Next we prove that an early abort strategy can decrease the complexity of the individual logarithm from Lp(1/3,1.447) to Lp(1/3,1.232).
Type de document :
Mémoires d'étudiants -- Hal-inria+
Cryptography and Security [cs.CR]. 2011
Liste complète des métadonnées


https://hal.inria.fr/inria-00588713
Contributeur : Razvan Barbulescu <>
Soumis le : lundi 14 mars 2016 - 08:26:21
Dernière modification le : jeudi 22 septembre 2016 - 14:31:15
Document(s) archivé(s) le : dimanche 13 novembre 2016 - 17:45:22

Fichier

hal.pdf
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

  • HAL Id : inria-00588713, version 3

Collections

Citation

Razvan Barbulescu. Improvements on the Discrete Logarithm Problem in GF(p). Cryptography and Security [cs.CR]. 2011. <inria-00588713v3>

Partager

Métriques

Consultations de
la notice

168

Téléchargements du document

84