If P \neq NP then Some Strongly Noninvertible Functions are Invertible

Details If P \neq NP then Some Strongly Noninvertible Functions are Invertible If P \neq NP then Some Strongly Noninvertible Functions are Invertible

2000-10-06

arxiv.org/abs/cs/0010011v1

Computer Science

Computational Complexity

Extended and updated version of UR-CS-TR-00-737

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

If P \neq NP then Some Strongly Noninvertible Functions are Invertible does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with If P \neq NP then Some Strongly Noninvertible Functions are Invertible, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and If P \neq NP then Some Strongly Noninvertible Functions are Invertible will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-300240