Jump to content

Key clustering

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by EdGl (talk | contribs) at 19:40, 5 July 2006. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

You must add a |reason= parameter to this Cleanup template – replace it with {{Cleanup|April 2006|reason=<Fill reason here>}}, or remove the Cleanup template.

In cryptography, key clustering is said to occur when two different keys generate the same ciphertext from the same plaintext, using same cipher algorithm. A good cipher algorithm, using different keys on the same plaintext, should generate a different ciphertext, irrespective of the key length.

Assume that there is a plaintext P, two different keys, K1 and K2, and an algorithm A. Ciphertexts C1 and C2 with the two keys are generated as follows:


P ----> A(K1 )----> C1


P ----> A(K2) ----> C2


C1 should not equal C2.