Due to its use in cryptographic protocols such as the Diffie–Hellman key exchange, the discrete logarithm problem attracted a considerable amount of attention in the past 40 years. In this paper, we summarize the key technical ideas and their evolution for the case of discrete logarithms in small characteristic finite fields. This road leads from the original belief that this problem was hard enough for cryptographic purpose to the current state of the art where the algorithms are so efficient and practical that the problem can no longer be considered for cryptographic use.

Additional Metadata
Persistent URL dx.doi.org/10.1007/s10623-015-0147-6
Journal Designs, Codes, and Cryptography
Citation
Pierrot, C.A, & Joux, A. (2016). Technical history of discrete logarithms in small characteristic finite fields: The road from subexponential to quasi-polynomial complexity. Designs, Codes, and Cryptography, 78(1), 73–85. doi:10.1007/s10623-015-0147-6