Hash Function
Hash Function: A function that maps a bit string of arbitrary length to a fixed-length bit string.
Definition
A function that maps a bit string of arbitrary length to a fixed-length bit string. Approved hash functions satisfy the following properties: 1. (one-way) It is computationally infeasible to find any input that maps to any pre-specified output, and 2. (collision-resistant) It is computationally infeasible to find any two distinct inputs that map to the same output.
Alternative Definitions
- Definition 2
An algorithm that computes a numerical value (called the hash value) on a data file or electronic message that is used to represent that file or message, and depends on the entire contents of the file or message. A hash function can be considered to be a fingerprint of the file or message.
- Definition 3
A hash function is any function that can be used to map data of arbitrary size to data of fixed size. The values returned by a hash function are called hash values, hash codes, hash sums, or simply hashes Voting system object code is “hashed” so that installations can be validated as identical to the certified version.
- Definition 4
A function that maps a bit string of arbitrary length to a fixed length bit string. Approved hash functions satisfy the following properties:
- Definition 5
A “function that maps a bit string of arbitrary length to a fixed length bit string. Approved hash functions satisfy the following properties: 1. (One-w ay) It is computationally infeasible to find any input that maps to any pre-specified output, and 2. (Collision resistant) It is computationally infeasible to find any two distinct inputs that map to the same output.” 2005 VVSG GLOSSARY. Hash functions are used to verify the integrity of messages or data.