Discrete Logarithms

Abstract : The Discrete Logarithm Problem (DLP) is one of the most used mathematical problems in asymmetric cryptography design, the other one being the integer factorization. It is intrinsically related to the Diffie-Hellman problem (DHP). DLP can be stated in various groups. It must be hard in well-chosen groups, so that secure-enough cryptosystems can be built. In this chapter, we present the DLP, the various cryptographic problems based on it, the commonly used groups, and the major algorithms available at the moment to compute discrete logarithms in such groups. We also list the groups that must be avoided for security reasons. Our computational model will be that of classical computers. It is to be noted that in the quantum model, DLP can be solved in polynomial time for cyclic groups.
Keywords : discrete logarithms
Type de document :
Chapitre d'ouvrage
Nadia El Mrabet; Marc Joye. Guide to pairing-based cryptography, CRC Press - Taylor and Francis Group, pp.42, 2016, 9781498729505. <https://www.crcpress.com/Guide-to-Pairing-Based-Cryptography/El-Mrabet-Joye/p/book/9781498729505>
Liste complète des métadonnées


https://hal.inria.fr/hal-01420485
Contributeur : Aurore Guillevic <>
Soumis le : mardi 20 décembre 2016 - 16:40:36
Dernière modification le : vendredi 17 février 2017 - 16:14:08
Document(s) archivé(s) le : lundi 20 mars 2017 - 22:03:56

Fichier

16_GuillevicMorain_Chapter9_Di...
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01420485, version 1

Citation

Aurore Guillevic, François Morain. Discrete Logarithms. Nadia El Mrabet; Marc Joye. Guide to pairing-based cryptography, CRC Press - Taylor and Francis Group, pp.42, 2016, 9781498729505. <https://www.crcpress.com/Guide-to-Pairing-Based-Cryptography/El-Mrabet-Joye/p/book/9781498729505>. <hal-01420485>

Partager

Métriques

Consultations de
la notice

285

Téléchargements du document

78