SHA-1  hashing function message length  2 64 bits  possible message values - (more precisely ) Hash value =160 bits - 2 160 possible hash values P (hash value of a new message) is anyone of these = 2 -160 Hashing function – requirements Pre-image resistance Second Pre-Image Resistance Collision Resistance
{}