1997-02-09 - Passphrase generation

Header Data

From: Internaut <unde0275@frank.mtsu.edu>
To: “‘cypherpunks@toad.com>
Message Hash: 8fe923de389fdc7c55f8303797d404129804f47bd3416423455c3b6109383cf4
Message ID: <01BC1675.656788C0@s17-pm04.tnstate.campus.mci.net>
Reply To: N/A
UTC Datetime: 1997-02-09 16:40:18 UTC
Raw Date: Sun, 9 Feb 1997 08:40:18 -0800 (PST)

Raw message

From: Internaut <unde0275@frank.mtsu.edu>
Date: Sun, 9 Feb 1997 08:40:18 -0800 (PST)
To: "'cypherpunks@toad.com>
Subject: Passphrase generation
Message-ID: <01BC1675.656788C0@s17-pm04.tnstate.campus.mci.net>
MIME-Version: 1.0
Content-Type: text/plain


Hi,
I am wanting to learn how to generate a passphrase that is at least as 
strong as the IDEA algorithm.  I have looked several other places on the 
web for an answer to this, but they all had different things to say that 
didn't add up (no pun intended :).
The IDEA algorithm it seems is 2^128 =  3.402823669209e+38 = 16 bytes 
(charactors).
The charactor count seems kinda small (I am presuming the 16 charactors are 
truely random).
Indeed, 128(ASCII charactor set)^16 =  5.192296858535e+33.
Is my thinking right here?
Is it better to do this- 94(printable ASCII set)^20 =  2.901062411315e+39, 
yielding 20 charactors?

Also, if you come up with a phrase and put enough (perhaps 5 or 6) ASCII 
nonsense in there for it not to be in any crack dictionaries, how random is 
that?  Is it only as random as the extra charactors you put in?  How would 
you calculate that?

Also, how many charactors do you have to add of a set to add its 
permulations (i.e. Does gibber&sh add all ASCII symbols to the equation)?

Thanks, Internaut






Thread