A polynomial form for logarithms modulo a prime (Corresp.)

Authors:
A. Wells, Jr.
Affiliations:
-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 3

Discrete logarithms in finite fields and their cryptographic significance

Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem

Discrete Applied Mathematics - Special issue: Coding and cryptography
Closed formulae for the Weil pairing inversion

Finite Fields and Their Applications

Quantified Score

Hi-index	754.84

Visualization

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 modulophas at leastp - 2nonzero coefficients and is therefore highly inefficient to use as a computational method.