Cryptography, Hashing, Learning, Data Structures, Merkle Tree.
should be no recognizable patterns in the obtained hash. Non-reversibility: Reconstructing a valid input for a given hash should not be possible, so that the only way to assert that an input corresponds to a hash is through trial and error (brute force!). Collision resistance: Finding two inputs