A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
The Discrete Logarithm Problem
[chapter]
2016
Open Problems in Mathematics
For large prime numbers p, computing discrete logarithms of elements of the multiplicative group (Z/pZ) * is at present a very difficult problem. The security of certain cryptosystems is based on the difficulty of this computation. In this expository paper we discuss several generalizations of the discrete logarithm problem and we describe various algorithms to compute discrete logarithms.
doi:10.1007/978-3-319-32162-2_12
fatcat:7hrvoz54tbfbji5rnalx2rssui