17 Dec
2003
17 Dec
'03
11:17 p.m.
where that leads me. If there were such attacks, they would rely on information about the key leaking into the ciphertext, independent of the plaintext. It might be possible to prove that any key-driven permutation This is bogus. No symetric algorithim has this characteristic, in fact,
On Sun, 17 Jul 1994, Carl Ellison wrote: the 1 on 1 nature of the algorithim precludes this as the total ammount of information is equal to the information in the plaintext. The proof is simple enumeration. Roger.