Computing Discrete Logarithms

Robert Granger; Antoine Joux

Paper 2021/1140 Original: eprint.iacr.org/2021/1140 ↗

Computing Discrete Logarithms

Robert Granger

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.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint.
History: 2021-09-10: last updated; 2021-09-10: published
Short URL: https://ia.cr/2021/1140
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2021/1140,
      author = {Robert Granger and Antoine Joux},
      title = {Computing Discrete Logarithms},
      howpublished = {Cryptology {ePrint} Archive, Paper 2021/1140},
      year = {2021},
      url = {https://eprint.iacr.org/2021/1140}
}