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
Complete list of metadatas

Cited literature [115 references]  Display  Hide  Download

https://hal.inria.fr/hal-01420485
Contributor : Aurore Guillevic <>
Submitted on : Tuesday, December 20, 2016 - 4:40:36 PM
Last modification on : Wednesday, March 27, 2019 - 4:41:27 PM
Long-term archiving on : Monday, March 20, 2017 - 10:03:56 PM

File

16_GuillevicMorain_Chapter9_Di...
Files produced by the author(s)

Identifiers

  • 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. ⟨hal-01420485v1⟩

Share

Metrics

Record views

519

Files downloads

808