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.
Schoof, R.j. (2016). The discrete logarithm problem. In J.a.R. Nash (a cura di), Open problems in mathematics (pp. 403-416). Springer International Publishing [10.1007/978-3-319-32162-2_12].
The discrete logarithm problem
Schoof
2016-01-01
Abstract
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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
schoof2016.pdf
accesso aperto
Licenza:
Copyright dell'editore
Dimensione
144.51 kB
Formato
Adobe PDF
|
144.51 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
