[67275] in Cypherpunks

home help back first fref pref prev next nref lref last post

Re: DESCrack keyspace partitioning

daemon@ATHENA.MIT.EDU (Gary Howland)
Fri Oct 4 08:40:58 1996

Date: Fri, 04 Oct 1996 14:23:33 +0200
From: Gary Howland <gary@systemics.com>
To: "geeman@best.com" <geeman@best.com>
Cc: "'cypherpunks@toad.com'" <cypherpunks@toad.com>

geeman@best.com wrote:
> 
> What about the heuristics of partitioning the keyspace?
> 
> Seems to me that a _subset_ of all possible keys is much more likely
> to appear than a random selection from an equidistributed population 0..2^56.
> 
> (P)RNG's just aren't that likely to produce a key of 010101010.....
> nor 001100110011...

Why?  They seem just as likely as any other sequence.

 etc etc and I have been thinking about how one might formalize
> and exploit this randomness property to increase the probability of finding the key sooner.

Again, which randomness property?


Gary
--
"Of course the US Constitution isn't perfect; but it's a lot better
than what we have now."  -- Unknown.

pub  1024/C001D00D 1996/01/22  Gary Howland <gary@systemics.com>
Key fingerprint =  0C FB 60 61 4D 3B 24 7D  1C 89 1D BE 1F EE 09 06

home help back first fref pref prev next nref lref last post