Citando da link
With a key of length n bits, there are 2n possible keys. This number grows very rapidly as n increases. The large number of operations (2128) required to try all possible 128-bit keys is widely considered out of reach for conventional digital computing techniques for the foreseeable future.
Perché la formula 2 è valida (qualunque sia la dimensione della chiave)?