Jump to content

Key clustering

Edit links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by EdGl (talk | contribs) at 03:48, 20 April 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.
 Key clustering is when two different keys generate the same ciphertext from the same plaintext, using same or different algorithm.

Ciphers (or algorithms) are used to encrypt the plaintext using keys. A good algorithm, using different keys on the same plaintext generates a different ciphertext, irrespective of the key length.

Assume that there is a plaintext P, two keys (of same length, assumed for simplicity) 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

Retrieved from "https://en.wikipedia.org/w/index.php?title=Key_clustering&oldid=49233784"