Content deleted Content added
Tag article as unsourced |
|||
Line 15:
If an attacker tries to break a cipher by a [[brute-force attack]], trying all possible keys until it finds the correct key, key clustering makes it easier to attack a particular cipher text. If there are ''n'' possible keys without any key clustering, the attacker needs to try an average of ''n''/2 keys to decrypt it and no more than ''n'' keys. If there are two keys that are clustered, the average number of keys is reduced to ''n''/4 and the maximum is ''n''-1 keys. If three keys cluster, the average attempt is only ''n''/6 attempts.
reference: CISSP Common Body of Knowledge Review by Alfred Ouyang, 2012 retrieved from site ://opensecuritytraining.info/CISSP-5-C_files/5-Cryptography-Part1.pdf
[[Category:Key management]]
| |||