Can be applied to a block of data of any size
●produce a fixed-length output
●relatively easy to compute of any given value,
making both hardware and software
For any given hash code h, it is computationally
infeasible to find x such that H(x) = h. We called it
For any given block x, it is computationally
infeasible to find y <> x with H(y) = H(x). This is
referred to as weak collision resistance.
It is computationally infeasible to find any pair (x,
y) such that H(x) = H(y). It is referred to as string
●As a fingerprint of a message, data or file
●Data Normalization (ID Generation)
publish the method and open the source for all
people to review.
●increase the length of the hash code.
Possible Cracking of
HKID Hash Code
Server had been cracked
●man in middle (Depends on the Design)
●Binary or source code disclose
●Fun on cracking my 30000 hash codes
A particular slide catching your eye?
Clipping is a handy way to collect important slides you want to go back to later.