How does a hash function behave like a random function?

In the earliest days of provably security, cryptographers realized that the ideal hash function would behave like a “random function”. This term refers to a function that is uniformly sampled from the set of all possible functions that have the appropriate input/output specification (domain and range).
For More Information Please Refer:


You May Also Like to Read: