enumeration attack

Recovering a hidden value by trying every possibility in a small, known set until one matches, such as every date of birth or every username.

In more detail

It works whenever the possible inputs are few enough to list: an unkeyed hash of a date of birth falls to hashing each of the roughly 33,000 dates between 1920 and 2010, and a login page that answers differently for real and unknown usernames reveals which accounts exist. A salt stored beside the hash does not help, because the attacker simply adds it to each guess. Defences include a keyed hash whose key is kept away from the data, identical error messages and rate limits. In asset management the same word is used with no attack in mind, for listing every device that is really on a network.

Examples

plain SHA-256: recovered 1987-03-14 after 24545 guesses
HMAC, key unknown: no match after 33238 guesses

Related terms

Taught in

References