On 5/17/06, Kuehn, Ulrich [EMAIL PROTECTED] wrote:
Given known plaintext and corresponding ciphertext, there should not be too
many keys that map the plaintext to the ciphertext. I don't have the
probability at hand how many such 'collisions' you would expect from 256 random
permutations, but
On 5/18/06, Travis H. [EMAIL PROTECTED] wrote:
... There's 255 other permutations, so the chance that there is
at least one k' such that f_k'(x)=y is 255/256 = 99.6%. The chance
that there is exactly one such k' is sampling with replacement and if
I am not mistaken P(K=1) = (255/256)^255 =
http://www.ucomics.com/tomtoles/2006/05/18/
Hat tip again to Steve Bellovin.
Perry

The Cryptography Mailing List
Unsubscribe by sending unsubscribe cryptography to [EMAIL PROTECTED]
Perry E. Metzger [EMAIL PROTECTED] writes:
http://www.ucomics.com/tomtoles/2006/05/18/
Here's one that got my attention:
http://www.workingforchange.com/comic.cfm?itemid=20803

A computer is a state machine.
Threads are for people who cant [sic] program state machines.
Alan Cox
At 08:05 AM 5/11/2006, Perry E. Metzger wrote:
Let me again remind people that if you do not inform your elected
representatives of your displeasure with this sort of thing,
eventually you will not be in a position to inform them of your
displeasure with this sort of thing.
I think begging