h(text)sums of all character codes in a text. It will produce the same hash value (collision) for texts holding the same letters in different order, i.e.
h('abc') == h('cab') == h('bca'). To avoid collisions, cryptographers have designed collision-resistant hash functions.
hash(p)for certain strong cryptographic hash function
p', such that