1996-10-04 - RE: DESCrack keyspace partitioning

Header Data

From: “geeman@best.com” <geeman@best.com>
To: “‘jbugden@smtplink.alis.ca>
Message Hash: 31bacbf457c2b134954b2d241dab01add452445a1a010f82a201a6b03ec6c2aa
Message ID: <01BBB1D1.991B3940@geeman.vip.best.com>
Reply To: N/A
UTC Datetime: 1996-10-04 20:50:15 UTC
Raw Date: Sat, 5 Oct 1996 04:50:15 +0800

Raw message

From: "geeman@best.com" <geeman@best.com>
Date: Sat, 5 Oct 1996 04:50:15 +0800
To: "'jbugden@smtplink.alis.ca>
Subject: RE: DESCrack keyspace partitioning
Message-ID: <01BBB1D1.991B3940@geeman.vip.best.com>
MIME-Version: 1.0
Content-Type: text/plain


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?






Thread