UConn Math Club
|
|---|
|
Abstract
|
|---|
We will introduce some basic notions of modern provably secure cryptography, including one-way functions and pseudorandom generators. Applications to natural cryptographic problems such as encryption and secure function computation will be discussed. No knowledge of cryptography is assumed. Web page for the Math Club: http://www.math.uconn.edu/~kconrad/mathclub |