| |
Weak-key attacks | page 1 of 12 |
More subtle problems can lead to dictionary-like attacks
as well. For example, say that some pseudo-random algorithm,
rather than a human user, selects the key. This is likely to
be an improvement, but maybe not enough of one. Attacker
Mallory might decide to cryptanalyze the key-generation
algorithm rather than the encryption per se. A less than
adequate key generator might produce all kinds of statistical
regularities in the keys it creates. It would be an
amazingly bad algorithm that only produced 100,000 possible
keys (as humans might); but a less than perfect key generator
might very well, for example, produce significantly more ones
in even-index key bits than zeros in those same positions. A
few statistical regularities in generated keys can knock
several orders of magnitude off Mallory's required efforts in
guessing keys. Making a key generator weak does not require
that it will never generate the key K -- it is
enough to know that K is significantly more or less likely to
occur than other keys. It is not good enough for a protocol
to be secure "some of the time".
|