Efficient Cryptographic Pseudorandom Generators

Abhishek Banerjee, CS (mmentor: Chris Peikert, CS) - Pseudorandom generators and pseudorandom functions have been widely studied and have a lot of uses in cryptography. We seek to construct pseudorandom objects which attain high stretch and are efficient, both computationally as well as in randomness. We wish to use the intractability of some well-known lattice problems to serve our purpose. Lattices offer us two significant advantages: most algorithms and operations on lattices are highly efficient, even linear in the security parameter, and parallelizable; and unlike factoring or discrete log, hard problems based on lattices have withstood quantum attacks.
My mentor for the project is Chris Peikert.