The process of applying a salt and cryptographic hash to a password then repeating the process many times is known as which of the following?

Collision resistance is a desirable property of a cryptographic hash function, meaning it is computationally infeasible to find two different inputs that produce the same output, rather than the iterative process of hashing a password multiple times.

A rainbow table is a precomputed table used by attackers to reverse hash functions and recover passwords, which key stretching is specifically designed to mitigate, not the process itself.

Key stretching is a technique that intentionally slows down the process of hashing a password by repeatedly applying a cryptographic hash function (often with a salt) thousands or millions of times. This significantly increases the computational effort and time required for an attacker to perform brute-force or dictionary attacks against stored password hashes.

A brute force attack is an adversarial method of attempting to guess a password by systematically trying numerous combinations, which key stretching helps defend against, rather than being the defensive process described.