Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/7458
Title: A Note on Cryptography and NP$\cap$ CoNP-P
Authors: Brassard, Giles
Fortune, Steven
Hopcroft, John E.
Keywords: computer science
technical report
Issue Date: Apr-1978
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR78-338
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.
URI: http://hdl.handle.net/1813/7458
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
78-338.pdf248.14 kBAdobe PDFView/Open
78-338.ps102.52 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us