A polynomial form for logarithms modulo a prime (Corresp.)
Andrew J. Wells · IEEE Transactions on Information Theory · 1984
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.