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 guessesHMAC, key unknown: no match after 33238 guessesRelated terms
- brute force attack — Trying many passwords against one account until one works.
- HMAC — A way of combining a secret key with a hash function to produce a tag that shows a message came from someone holding the key and was not changed.
- salt — An extra value mixed into data before hashing so that otherwise identical inputs produce different hashes.
- anonymisation — Changing data so it can no longer be linked to the person it came from, by anyone, using any means reasonably likely to be used.
- broken object level authorization — An API flaw where changing an identifier in a request, such as /tasks/2 instead of /tasks/1, lets a caller reach an object that belongs to someone else.
- unguessable identifier — An identifier made from enough random bits, such as secrets.token_urlsafe(12), that nobody can guess another valid one.
Taught in
- Data States: Security at Rest, in Transit, and in Use — Cybersecurity Fundamentals, GRC & Cryptography
- Asset Lifecycle Management & Media Sanitization — Cybersecurity Fundamentals, GRC & Cryptography
- Broken Object Level Authorization — Application Security & Threat Modeling for Engineers