The Discrete Logarithm Problem [chapter]

René Schoof
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