Computation of Discrete Logarithms in Prime Fields
Library Home 
Full Table of Contents 
Suggest a Link 
Library Help
http://www.research.att.com/~bal/papers/crypto/field/  


LaMacchia, Odlyzdo; AT&T Bell Laboratories, NJ  
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.  


Levels:  Research 
Languages:  English 
Resource Types:  Articles 
Math Topics:  Linear Algebra, Logarithms, Cryptography 
[Privacy Policy] [Terms of Use]
© 1994 Drexel University. All rights reserved.
http://mathforum.org/
The Math Forum is a research and educational enterprise of the Drexel University School of Education.