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

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