[67293] in Cypherpunks
RE: DESCrack keyspace partitioning
daemon@ATHENA.MIT.EDU (geeman@best.com)
Fri Oct 4 11:39:46 1996
From: "geeman@best.com" <geeman@best.com>
To: "'jbugden@smtplink.alis.ca'" <jbugden@smtplink.alis.ca>
Cc: "'cypherpunks@toad.com'" <cypherpunks@toad.com>
Date: Fri, 4 Oct 1996 08:52:51 -0700
Sorry, but you are ASSUMING that which I
dispute.
The point I am making is that keys in the real world
are not uniformly distributed.
Some results forthcoming.
Suppose we have a function f() that randomly chooses an integer between 1 and
100 such that each integer in the range is equally likely to be selected on each
call.
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
If we call f() 6 times, each time noting whether the result is even or
odd, which of the following sequences is more likely?
