OneWayFunctions.ppt

11/15/2004 CSC 486 : Hem-Ogi 2.1 Hem-Ogi 2.1: One Way Functions GEM Group 2: Benjamin Van Durme Pin Lu Ross Messing Shivashankar Balu Tanushree Mittal Definitions One Way Functions : A function that is easy to compute and hard to invert There are no known functions that have been proven to be one way Much like we don’t know if P=NP… In general, we want to say that f is one way if : f (x) = y can be computed in polynomial time, but its inverse: g (y) =x cannot be computed in polynomial time Definition 2.1 : Honesty Honesty : We say a function f, is honest if Example of Honesty Consider the function f (x) = The output is so short relative to the input that it will take triple exponential time to write the inverse Thus, f is polynomial time computable, but not polynomial time invertible naively, this would seem to be a one way function However, the “non-easy” invertibility of f is only due to a “cheap trick” where we’ve forced the inversion function to spend all of its time simply writing the result That’s not fair! We preclude these types of functions by requiring all those that are “truly” one way to be HONEST Definition 2.2 : Poly time invertible A function f is polynomial-time invertible if there is a polynomial-time computable function g such that : Definition 2.3 : One way A function f is one way if : f is polynomial-time computable, and f is not polynomial time invertible, and f is honest Definition 2.4 : One to one A function f : ?* ! ?* is one to one if: ( 8 y 2 ?* ) [ ||f x | f (x ) = y g|| · 1 ] Theorem 2.5 One-way functions exist iff P?NP One-to-one one-way functions exist iff P?UP We will be spending the rest of class proving these two points. The proof for the second point is a modification of the first, so pay close attention to the details, as we’ll be glossing over some things the second time around. Proof : One way functions exist iff P?NP Breaking this