Taking the modulus with respect to a prime is a common last step in algorithms implementing these computational functions.
A Leftover Lemma for privacy amplification is named for these entities and uses pairwise independent ones for randomness extraction. A one-way compression function is used to create one of these objects in the Merkle-Damgard construction. Good expected performance, even against an adversary, can be guaranteed by randomly picking one of these objects from a universal family. Padding the input of these mathematical objects is known as "salting." One method to solve a major problem with them is chaining. Taking the modulus with respect to a prime is a common last step in algorithms implementing these computational functions. Exemplified by the SHA algorithms, these objects are subject to collisions when their one-to-one property breaks down. For 10 points, name these functions subject used to map data to fixed-length strings.
A Leftover Lemma for privacy amplification is named for these entities and uses pairwise independent ones for randomness extraction.
hash functions [or hashes]