From: “geeman@best.com” <geeman@best.com>
To: “‘Vladimir Z. Nuri’” <vznuri@netcom.com>
Message Hash: 22acd1e2e0f4c3738f50bf82ee19610e165e964c22700d1159c534371ab08f60
Message ID: <01BBB3E4.1BE61700@geeman.vip.best.com>
Reply To: N/A
UTC Datetime: 1996-10-07 08:59:55 UTC
Raw Date: Mon, 7 Oct 1996 16:59:55 +0800
From: "geeman@best.com" <geeman@best.com>
Date: Mon, 7 Oct 1996 16:59:55 +0800
To: "'Vladimir Z. Nuri'" <vznuri@netcom.com>
Subject: RE: DESCrack keyspace partitioning
Message-ID: <01BBB3E4.1BE61700@geeman.vip.best.com>
MIME-Version: 1.0
Content-Type: text/plain
: Re: DESCrack keyspace partitioning
of course, any number in the range of a random number
generator is theoretically as likely/unlikely to appear.
however, consider the case in which DES keys are generated
from ascii sequences or words that people enter in at
password prompts, which is in fact how the unix passwd file
word. these obviously have far less randomness
and Gary's attempt to narrow the keyspace is highly
relevant.
>> Gary?
also, I took his post as suggesting that some parts of the
keyspace ought to be searched at higher priority than
others. in the above example, keys that correspond to
ascii sequences typable on a keyboard should be searched
first in the keyspace.
>> Something like that.
a lot of systems use DES only in conjuction with a one-time-key
generated for a particular message. (similar to the way
PGP uses IDEA for the session key, and transmits this encoded
key using RSA). in general I would say these could be considered
random in a way that the previous "less-than-random" property
doesn't hold.
>> Depends. Not if generated by certain processes that **tend** to produce
non-entropic values. But I have more work to do on this....
Return to October 1996
Return to ““geeman@best.com” <geeman@best.com>”
1996-10-07 (Mon, 7 Oct 1996 16:59:55 +0800) - RE: DESCrack keyspace partitioning - “geeman@best.com” <geeman@best.com>