Exhaustive key search
= Exhaustive key search
Trying candidate keys and testing them against known <plaintext>–<ciphertext> pairs or another available verification condition. A uniformly selected key in a space of size $2^m$ appears at average position $(2^m+1)/2$ in a fixed enumeration.