Abstract
The presumed difficulty of computing discrete logarithms in finite fields is the basis of several popular public key cryptosystems. The secure identification option of the Sun Network File System, for example, uses discrete logarithms in a field GF(p) with p a prime of 192 bits. This paper describes an implementation of a discrete logarithm algorithm which shows that primes of under 200 bits, such as that in the Sun system, are very insecure. Some enhancements to this system are suggested.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 47-62 |
| Number of pages | 16 |
| Journal | Designs, Codes and Cryptography |
| Volume | 1 |
| Issue number | 1 |
| DOIs | |
| State | Published - May 1991 |