A Note on Cryptography and NPnCoNP-P.
The use of the exponential function in a finite field for cryptographic purposes is studied. The proposal is based on the conjecture that the inverse function, the logarithm, is not feasibly computable. A proof of this conjecture would have important consequences for theoretical computer science, even under the assumption that P does not equal NP.