[Resource Topic] 2021/1140: Computing Discrete Logarithms

Welcome to the resource topic for 2021/1140

Computing Discrete Logarithms

Authors: Robert Granger, Antoine Joux


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.

ePrint: https://eprint.iacr.org/2021/1140

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .