DocumentCode :
939634
Title :
A polynomial form for logarithms modulo a prime (Corresp.)
Author :
Wells, Albert L., Jr.
Volume :
30
Issue :
6
fYear :
1984
fDate :
11/1/1984 12:00:00 AM
Firstpage :
845
Lastpage :
846
Abstract :
An explicit polynomial form for logarithm functions modulo a prime p is given; the coefficients have a surprisingly simple form. It follows that any polynomial that represents a logarithm modulo 
has at least 
nonzero coefficients and is therefore highly inefficient to use as a computational method.
has at least nonzero coefficients and is therefore highly inefficient to use as a computational method.Keywords :
Cryptography; Logarithmic arithmetic; Polynomials; Codes; Cryptography; Feedback; Information theory; Memoryless systems; Polynomials; Publishing; Security;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1984.1056986
Filename :
1056986
Link To Document :
