Question: 5.1 (10 points) Let f:{0,1}{0,1} be an efficiently computable injective (i.e., one to one) function. Show that if f has a hard-core predicate as in

5.1 (10 points) Let f:{0,1}{0,1} be an efficiently computable injective (i.e., one to one) function. Show that if f has a hard-core predicate as in Definition7 then f is one way. 5.2 (10 points) Is this implication necessarily true when G not injective? Either prove or show a counter example
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
