Re: Hashing messages with lengths between 32 and 128 bytes is one of the most important practical issue (was Re: the skein hash function)

2010-08-01 Thread Sampo Syreeni
On 2010-07-30, Paul wrote: Deterministically generated and cryptographically strong random numbers are used in tens of NIST Approved Algorithms. They are constructed by using an approved hash algorithm, and there, hashing is performed over relatively short messages from 32 to 128 bytes. [...]

Hashing messages with lengths between 32 and 128 bytes is one of the most important practical issue (was Re: the skein hash function)

2010-07-30 Thread Paul
Bill Stewart wrote: Sent: Thursday, October 30, 2008 7:30 AM To: Cryptography List Subject: Re: the skein hash function > So if Skein becomes popular, ASIC accelerator hardware > may be practical for higher-speed applications. I see another strong point for Skein: Deterministically generated a