College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
|Title: ||A Note on Cryptography and NP$\cap$ CoNP-P|
|Authors: ||Brassard, Giles|
Hopcroft, John E.
|Keywords: ||computer science|
|Issue Date: ||Apr-1978|
|Publisher: ||Cornell University|
|Abstract: ||Diffie and Hellman  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.|
|Appears in Collections:||Computer Science Technical Reports|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.