Cryptography Question:

1. Let G be a pseudorandom generator with expansion factor , where () is a polynomial, and for all n, it holds that (n) > n. Please describe a computationally secure private-key encryption scheme based on such G.

2. Please prove that the private-key encryption scheme you constructed above is secure, if the underlying pseudorandom generator G is secure.