A Concrete Introduction to Higher Algebra, 2nd Edition

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
University of California — Berkeley Handout CS276: Cryptography March 15, 2002 Professors Luca Trevisan and David Wagner Midterm This midterm is due at the start of class on Tuesday, March 19th. When you are asked to prove or disprove a statement S , you actually have three options: you may show that S is unconditionally true; you may show that S is unconditionally false; or, you may show that S is conditionally true under some standard assumption (e.g., that one-way functions exist) and false otherwise. For each problem, be sure to state clearly and precisely what result you are going to prove before proving it. You do not need to re-prove anything covered in class. This exam is “open-notes” (you may use anything in your notes or the online scribe notes) but “closed-book” (you may not use any textbook or other source). Problem 1. [Injective Pseudorandom Generators] We want to show that pseudorandom generators may or may not be 1-1 functions. (a) Assuming the existence of one-way permutations of superpolynomial security, prove the existence of a pseudorandom generator G : { 0 , 1 } n → { 0 , 1 } n +1 of superpolynomial security with the additional property that G is a 1-1 function. (b)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/04/2008 for the course CS 276 taught by Professor Trevisan during the Spring '02 term at University of California, Berkeley.

Page1 / 3

Mar 14 Midterm - University of California - Berkeley CS276:...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online