DocumentCode :
939182
Title :
Fast evaluation of logarithms in fields of characteristic two
Author :
Coppersmith, Don
Volume :
30
Issue :
4
fYear :
1984
fDate :
7/1/1984 12:00:00 AM
Firstpage :
587
Lastpage :
594
Abstract :
A method for determining logarithms in GF 
is presented. Its asymptotic running time is 
for a small constant 
, while, by comparison, Adleman\´s scheme runs in time 
. The ideas give a dramatic improvement even for moderate-sized fields such as GF 
, and make (barely) possible computations in fields of size around 
. The method is not applicable to GF 
for a large prime 
.
is presented. Its asymptotic running time is for a small constant , while, by comparison, Adleman\´s scheme runs in time . The ideas give a dramatic improvement even for moderate-sized fields such as GF , and make (barely) possible computations in fields of size around . The method is not applicable to GF for a large prime .Keywords :
Cryptography; Galois fields; Logarithmic arithmetic; Communication system security; Cryptography; Galois fields; Graphics; Polynomials; Proposals; Silver;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1984.1056941
Filename :
1056941
Link To Document :
