A brute-force attack is attempting to find a secret value by trying all possible values until the correct one is found. As the length of the secret value increases, the difficulty of an exhaustive search increases exponentially. Testing if a guess value is correct typically requires using it as an input to a function; if that function is moderately hard to compute, the difficulty of the exhaustive search also increases.

history | show excerpt | excerpt history