Re: Are there problems with Merkle-Damgaard and SHA-256?

From: Francois Grieu (fgrieu_at_francenet.fr)
Date: 08/31/05


Date: Wed, 31 Aug 2005 08:07:48 +0200

In article <slrndh2pjl.1ti6.usenet@stoneport.math.uic.edu>,
 "D. J. Bernstein" <djb@cr.yp.to> wrote:

> * SHA-256(m) takes two invocations of the compression function
> when m is short.

I checked again, and come to the conclusion that SHA-256(m)
takes ONE invocation of the compression function whem m is
less than 448 bits. Did I miss something?

   François Grieu