Key clustering: Difference between revisions

Revision as of 05:47, 27 December 2006

Revision as of 20:19, 17 January 2007

Line 6:

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.