cryptoanarchy.wiki

Arise, you have nothing to lose but your barbed wire fences!

1996-10-04 - Re: DESCrack keyspace partitioning

Header Data

From: Gary Howland <gary@systemics.com>
To: “geeman@best.com>
Message Hash: 65b3a0f9279920b42d2175caba5a21d36f95d011cad51ed1498858af0c04e5bf
Message ID: <325501C5.167EB0E7@systemics.com>
Reply To: <01BBB163.FC317940@geeman.vip.best.com>
UTC Datetime: 1996-10-04 16:00:12 UTC
Raw Date: Sat, 5 Oct 1996 00:00:12 +0800

Raw message

From: Gary Howland <gary@systemics.com>
Date: Sat, 5 Oct 1996 00:00:12 +0800
To: "geeman@best.com>
Subject: Re: DESCrack keyspace partitioning
In-Reply-To: <01BBB163.FC317940@geeman.vip.best.com>
Message-ID: <325501C5.167EB0E7@systemics.com>
MIME-Version: 1.0
Content-Type: text/plain


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

Thread