University of Virginia, Department of Computer Science
CS200: Computer Science, Spring 2004

Notes: Wednesday 14 April 2004
Schedule

Notes

Ways to authenticate:

Links

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).

cs200-staff@cs.virginia.edu
Using these Materials