1. On polynomial approximation of the discrete logarithm and the Diffie–Hellman mapping;Coppersmith;J. Cryptol.,2000
2. A class of Boolean functions with linear combinational complexity;Harper;Theoret. Comput. Sci.,1975
3. S. Jukna, A. Razborov, P. Savický, I. Wegener, On P versus NP∩ co-NP for decision trees and read-once branching programs, Mathematical Foundations of Computer Science (Bratislava), Lecture Notes in Computer Science, Vol. 1295, Springer, Berlin, 1997, pp. 319–326.
4. On P versus NP∩CO-NP for decision trees and read-once branching programs;Jukna;Comput. Complexity,1999
5. A Course in Number Theory and Cryptography;Koblitz,1994