Title :
A note on the complexity of cryptography (Corresp.)
Author :
Brassard, Gilles
fDate :
3/1/1979 12:00:00 AM
Abstract :
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.
Keywords :
Computation theory; Cryptography; Computational modeling; Computer science; Cryptography; Galois fields; Polynomials; Proposals; Security; Terrorism; Turing machines;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1979.1056010
