A note on the complexity of cryptography (Corresp.)
Gilles Brassard · IEEE Transactions on Information Theory · 1979
Evidence is given for the difficulty of an eventual proof of computational security for cryptosystems based on one-way functions, such as the one proposed by Diffie and Hellman. A proof of NP-completeness for the cryptanalytic effort would imply NP=CoNP.