University of Virginia Computer Science
CS150: Computer Science, Fall 2005

4 November 2005

CS150 Notes 31 (4 November 2005)

Upcoming Schedule


Ways to authenticate:

Cryptographic Hash Functions

One-way: Given h, it is hard to find x such that H(x) = h.
Collision Resistent: Given x, it is hard to find y not equal to x such that H(y) = H(x).