A Note on Cryptography and NP$\cap$ CoNP-P

Authors:
Giles Brassard;Steven Fortune;John E. Hopcroft
Affiliations:
-;-;-
Venue:
A Note on Cryptography and NP$\'cap$ CoNP-P
Year:
1978

Citing 0
Cited 3

Quantum cryptography: A survey

ACM Computing Surveys (CSUR)
Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions

Theoretical Computer Science
Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for one-way functions in complexity theory

ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.