Term:Hash Function

From FISMApedia

Contents 1 FIPS 201-1 2 NIST IR 7298 3 NIST IR 7298 4 NIST SP 800-108 5 NIST SP 800-120 6 NIST SP 800-48 7 NIST SP 800-56A 8 NIST SP 800-57P1 9 NIST SP 800-63v1.0.2 10 NIST SP 800-90

FIPS 201-1

Hash Function - 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. 2. Collision Resistant. It is computationally infeasible to find any two distinct inputs that map to the same output.

NIST IR 7298

Hash Function - 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.

2) Collision Resistant. It is computationally infeasible to find any two distinct inputs that map to the same output. SOURCE: SP 800-63; FIPS 201

NIST IR 7298

Hash Function - An Approved mathematical function that maps a string of arbitrary length (up to a pre-determined maximum size) to a fixed length string. It may be used to produce a checksum, called a hash value or message digest, for a potentially long string or message. SOURCE: FIPS 198

NIST SP 800-108

Hash Function - A function that maps a bit string of arbitrary length to a fixed length bit string. Approved hash functions are designed to 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.

Approved hash functions are specified in FIPS 180-3 [6].

NIST SP 800-120

Hash Function - A function that maps a bit string of arbitrary length to a fixed length bit string. Approved hash functions are designed to 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.

Approved hash functions are specified in FIPS 180-3 [1]. In some EAP methods, hash functions are used in digital signatures and to build key derivation functions and message authentication codes.

NIST SP 800-48

Hash Function - A computationally efficient algorithm that maps a variable-sized amount of text into a fixed-sized output ( hash value). Hash functions are used in creating digital signatures.

NIST SP 800-56A

Hash Function - 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.

Approved hash functions are specified in FIPS 180-2 [2].

NIST SP 800-57P1

Hash Function - 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.

NIST SP 800-63v1.0.2

Hash Function - 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.

NIST SP 800-90

Hash Function - A (mathematical) function that maps values from a large (possibly very large) domain into a smaller range. The function satisfies the following properties: 1. (One-way) It is computationally infeasible to find any input that maps to any pre-specified output; 2. ( Collision free) It is computationally infeasible to find any two distinct inputs that map to the same output.