1. Diffie, W. and Hellman, M.E., "New Directions in Cryptography", IEEE Transactions on Information Theory, Vol. 22, 1976, pp. 644–654.
2. Brassard, G., Fortune, S., and Hopcroft, J., "A Note on Cryptography and NP ∩ CoNP-P", TR78-338, Dept. of Comp. Sci., Cornell University.
3. Karp, R.M., "Reducibility Among Combinatorial Problems", in R.E. Miller and J.W. Thatcher (eds.), Complexity of Computer Computations, Plenum Press, 1972, pp. 85–104.
4. Garey, M.R., and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, 1979.
5. Aho, A.V., Hopcroft, J.E. and Ullman, J.D., The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.