1. On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping;Coppersmith;J. Cryptology,2000
2. A class of Boolean functions with linear combinational complexity;Harper;Theoret. Comput. Sci,1975
3. A course in number theory and cryptography;Koblitz,1994
4. Algebraic aspects of cryptography;Koblitz,1998
5. T. Lange and A. Winterhof, Incomplete character sums over finite fields and their application to the interpolation of the discrete logarithm by Boolean functions, Preprint.