Hash functionsH

• compress length of message 1M bits (any number) 128 or 160 bits

• “collision-free” for any x one can not compute y = x, H(x) = H(y)

• “random-like” behavior

E.G. SHA-1, MD5, MD2

Previous slide

Next slide

Back to first slide

View graphic version