collision-resistant hash-function (3.1): hash-function satisfying the following property: it is computationally infeasible to find any two distinct inputs which map to the same output · Note 1 to entry: Computational feasibility depends on the specific security requirements and environment. (†2237)
hash code (3.3): string of bits which is the output of a hash-function. · Note 1 to entry: The literature on this subject contains a variety of terms that have the same or similar meaning as hash-code. Modification Detection Code, Manipulation Detection Code, digest, hash-result, hash-value and imprint are some examples. (†2238)
hash function (3.4): function which maps strings of bits of variable (but usually upper bounded) length to fixed-length strings of bits, satisfying the following two properties:
— for a given output, it is computationally infeasible to find an input which maps to this output;
— for a given input, it is computationally infeasible to find a second input which maps to the same output.
· Note 1 to entry: Computational feasibility depends on the specific security requirements and environment. (†2236)
