Hashing algorithm

A hashing algorithm maps binary values of an arbitrary length to smaller binary values of a fixed length, known as hash values. A hash value is a numerical representation of data. If you “hash” a paragraph of plaintext and change even one character of the paragraph, a subsequent hash will produce a different value. Cryptographically strong hashes will change significantly for any change in the original plaintext. It is considered computationally infeasible to find two distinct inputs that hash to the same value though possible.