Hash Function

A hash function is any algorithm or subroutine that maps large data sets of variable length, called keys, to smaller data sets of a fixed length. For example, a person's name, having a variable length, could be hashed to a single integer. The values returned by a hash function are called hash values, hash codes, hash sums, checksums or simply hashes.

Read more about Hash FunctionDescriptions, Hash Function Algorithms, Origins of The Term, List of Hash Functions

Other articles related to "functions, function, hash function, hash":

One-way Compression Function - Construction From Block Ciphers
... One-way compression functions are often built from block ciphers ... Block ciphers take (like one-way compression functions) two fixed size inputs (the key and the plaintext) and return one single output (the ciphertext ... can be found simply by using the block cipher's decryption function ...
JH (hash Function)
... JH is a cryptographic hash function submitted to the NIST hash function competition by Hongjun Wu ... Though chosen as one of the five finalists of the competition, JH ultimately lost to NIST hash candidate Keccak ... Apply a 42-round unkeyed permutation (encryption function) to the state ...
List of Hash Functions
... Bernstein hash Fowler-Noll-Vo hash function (32, 64, 128, 256, 512, or 1024 bits) Jenkins hash function (32 bits) Pearson hashing (8 bits) Zobrist hashing ...
Lane (hash Function)
... Lane is a cryptographic hash function submitted to the NIST hash function competition it was designed by Sebastiaan Indesteege with contributions by ...

Famous quotes containing the word function:

    My function in life is not to be a politician in Parliament: it is to get something done.
    Bernadette Devlin (b. 1947)