You are looking at a specific version 20210910:102029 of this paper.
See the latest version.
Paper 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.
Metadata
- Available format(s)
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. To appear in "Computational Cryptography - Algorithmic Aspects of Cryptology".
- Keywords
- discrete logarithm problem
- Contact author(s)
- r granger @ surrey ac uk,joux @ cispa de
- History
- 2021-09-10: revised
- 2021-09-10: received
- See all versions
- Short URL
- https://ia.cr/2021/1140
- License
-
CC BY