If P ≠ NP then Some Strongly Noninvertible Functions Are Invertible
Rabi, Rivest, and Sherman alter the standard notion of noninvertibility to a new notion they call strong noninvertibility, and show—via explicit cryptographic protocols for secret-key agreement ([RS93,RS97] attribute this to Rivest and Sherman) and digital signatures [RS93,RS97]—that strongly noninvertible functions would be very useful components in protocol design. Their definition of strong noninvertibility has a small twist (“respecting the argument given”) that is needed to ensure cryptographic usefulness. In this paper, we show that this small twist has a large, unexpected consequence: Unless P = NP, some strongly noninvertible functions are invertible.
KeywordsComputational and Structural Complexity
Unable to display preview. Download preview PDF.
- [BC93]D. Bovet and P. Crescenzi. Introduction to the Theory of Complexity. Prentice Hall, 1993.Google Scholar
- [BDG95]J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. EATCS Texts in Theoretical Computer Science. Springer-Verlag, second edition, 1995.Google Scholar
- [Ber77]L. Berman. Polynomial Reducibilities and Complete Sets. PhD thesis, Cornell University, Ithaca, NY, 1977.Google Scholar
- [BHHR99]A. Beygelzimer, L. Hemaspaandra, C. Homan, and J. Rothe. One-way functions in worst-case cryptography: Algebraic and security properties are on the house. SIGACT News, 30(4):25–40, December 1999.Google Scholar
- [Hom00]C. Homan. Low ambiguity in strong, total, associative, one-way functions. Technical Report TR-734, University of Rochester, Department of Computer Science, Rochester, NY, August 2000.Google Scholar
- [Pap94]C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.Google Scholar
- [RS93]M. Rabi and A. Sherman. Associative one-way functions: A new paradigm for secret-key agreement and digital signatures. Technical Report CS-TR-3183/UMIACS-TR-93-124, Department of Computer Science, University of Maryland, College Park, Maryland, 1993.Google Scholar
- [She86]A. Sherman. Cryptology and VLSI (a Two-Part Dissertation). PhD thesis, MIT, Cambridge, MA, 1986. Available as Technical Report MIT/LCS/TR-381.Google Scholar