JavaScript is disabled for your browser. Some features of this site may not work without it.
A Note on Cryptography and NP$\cap$ CoNP-P

Author
Brassard, Giles; Fortune, Steven; Hopcroft, John E.
Abstract
Diffie and Hellman [2] propose the use of the exponential function in a finite field for cryptographic purposes. The proposal is based on the conjecture that the inverse function, the logarithm, is not feasibly computable. We show that a proof of this conjecture would have important consequences for theoretical computer science, even under the assumption that P $neq$ NP.
Date Issued
1978-04Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR78-338
Type
technical report