Cryptology ePrint Archive: Report 2021/1140

Computing Discrete Logarithms

Robert Granger and Antoine Joux

Abstract: We describe some cryptographically relevant discrete logarithm problems (DLPs) and present some of the key ideas and constructions behind the most efficient algorithms known that solve them. Since the topic encompasses such a large volume of literature, for the finite field DLP we limit ourselves to a selection of results reflecting recent advances in fixed characteristic finite fields.

Category / Keywords: public-key cryptography / discrete logarithm problem

Original Publication (in the same form): To appear in "Computational Cryptography - Algorithmic Aspects of Cryptology".

Date: received 8 Sep 2021, last revised 10 Sep 2021

Contact author: r granger at surrey ac uk, joux at cispa de

Available format(s): PDF | BibTeX Citation

Version: 20210910:102029 (All versions of this report)

Short URL: ia.cr/2021/1140


[ Cryptology ePrint archive ]