Jump to content

Hash function

From Simple English Wikipedia, the free encyclopedia
Revision as of 13:07, 3 August 2017 by 2a02:c7d:1275:700:148b:2017:a3dc:d4d1 (talk) (Expanded the article by adding a paragraph relating to a "Cryptographic" hash function.)
How a hash function works

The Hash function is a function. When a computer program is written, very often, large amounts of data need to be stored. These are normally stored in tables. In order to find the data again, some value is calculated. This is like when someone reads a book, and to remember, they put what they read into their own words. Hash values are much the same, except that care is taken that different sets of data do not get the same hash value (this is called a hash collision). A cryptographic hash function is a hash function which takes an input (or 'message') and returns a fixed-size alphanumeric string. The string is called the 'hash value', 'message digest', 'digital fingerprint', 'digest' or 'checksum'.

Hash table