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

[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. [...]

Do not forget protocol replies either. The best protocols usually cut 
down the overhead to a minimum, either because of analyzability, or more 
commonly because of speed/latency. That means that cryptographically 
securing the *very* best protocols also implies various cryptographic 
primitives on very short messages.
-- 
Sampo Syreeni, aka decoy - decoy at iki.fi, http://decoy.iki.fi/front
+358-50-5756111, 025E D175 ABE5 027C 9494 EEB0 E090 8BA9 0509 85C2

---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo at metzdowd.com