A hash algorithm takes a plaintext document as input and produces a mathematical result for the two inputs. This mathematical result is referred to as a hash value, message digest, or digest. If a single character is changed in the plaintext document, the resulting message digest will no longer match the original message digest.
Note It is technically possible for two data inputs to produce the same digest with the hash algorithm. Although possible, it is mathematically improbable.
Was this article helpful?