Re: Hashing methods for giant keys
From: AE (hidden@nospam.com)
Date: 03/23/03
- Next message: Kim Hyldgaard: "Re: Security in RADIUS (RFC2865)"
- Previous message: Douglas A. Gwyn: "Re: Leopard10 source code update"
- In reply to: lurker: "Re: Hashing methods for giant keys"
- Next in thread: lurker: "Re: Hashing methods for giant keys"
- Reply: lurker: "Re: Hashing methods for giant keys"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
From: AE <hidden@nospam.com> Date: Sun, 23 Mar 2003 21:54:01 +0100
lurker wrote:
> ...
> The entropy in an 80 character passphrase would be largely wasted if
> hashed to a single 56 bit DES keyspace.
>
> How many unique output hash results can there be in the digest of SHA
> 512?
There are (quite obviously) 2^512 possible output values - this is a
number with 154 decimal digits.
A passphrase of 80 characters is likely to consist of plain english (or
whatever language you are using) text - or it consists of random
characters that are written down which means you are anyway in trouble.
English text contains about 1.4 bit of enthropy per character - which
means your 80 characters can be compressed to about 112bit without
losing strength of the resulting key.
In this case the 128 bit output of MD5 are by far sufficient.
As long as your passphrase is not longer than 300 characters SHA-512 or
whirlpool will be good enough.
Anyway if you are bothered about a key of only 128 bit you are expecting
problems at the wrong place: There are always other, easier ways to
break your system than running a brute-force-attack on a 128 bit key.
> I am assuming that long strings are parsed into equal length input
> segments before hashing. Could you use eight MD5 digests in place of
> one SHA 512 digest to create an equivalent compound key?
In case you have to fill a larger buffer with key-material you can
always re-hash your password using the last output as starting value.
AE
- Next message: Kim Hyldgaard: "Re: Security in RADIUS (RFC2865)"
- Previous message: Douglas A. Gwyn: "Re: Leopard10 source code update"
- In reply to: lurker: "Re: Hashing methods for giant keys"
- Next in thread: lurker: "Re: Hashing methods for giant keys"
- Reply: lurker: "Re: Hashing methods for giant keys"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|