DocumentCode
940546
Title
A subexponential-time algorithm for computing discrete logarithms over 
Author
Elgamal, Taher
Volume
31
Issue
4
fYear
1985
fDate
7/1/1985 12:00:00 AM
Firstpage
473
Lastpage
481
Abstract
An algorithm for computing discrete logarithms over GF 
, where 
is a prime, in subexponential time is described. The algorithm is similar to the Merkle-Adleman algorithm for computing logarithms over GF 
, but it uses quadratic fields as the appropriate algebraic structure. It also makes use of the idea of a virtual spanning set due to Hellman and Reyneri for computing discrete logarithms over GF 
, for 
growing and fixed.
, where is a prime, in subexponential time is described. The algorithm is similar to the Merkle-Adleman algorithm for computing logarithms over GF , but it uses quadratic fields as the appropriate algebraic structure. It also makes use of the idea of a virtual spanning set due to Hellman and Reyneri for computing discrete logarithms over GF , for growing and fixed.Keywords
Cryptography; Galois fields; Logarithmic arithmetic; Helium; Information systems; Milling machines; National security; Polynomials; Public key cryptography;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1985.1057075
Filename
1057075
Link To Document