Re: message digest of large files

From: Mike Amling (nospam_at_nospam.com)
Date: 08/18/05 

Date: Thu, 18 Aug 2005 18:39:40 GMT

bryanjugglercryptographer@yahoo.com wrote:
> Mike Amling wrote:
>
>> Both SHA1 and MD5 are defined for inputs of up to (2**64)-1 bits.
>
>
> Right for SHA-1, but MD5 takes input of arbitrary length.
>
> The algorithm takes as input a message of arbitrary length
> and produces [...] [RFC 1321, Section 1]
>
> In the unlikely event that b is greater than 2^64, then only
> the low-order 64 bits of b are used. [RFC 1321, Section 3.2,
> Step 2]
>
> Hmmm, that should probably read, 'greather than *or equal to*'.
> Oh well, it's broken anyway.

   Thanks for clarifying that.

--Mike Amling

Relevant Pages

  • Re: Fastest Signature Scheme for Verification
    ... Mike Amling wrote: ... tolerant algorithm by putting in maximum effort to make sure the right ... root is calculated. ... In particular, faulty precomputed constants can ...
    (sci.crypt)
  • Re: The METHOD of creating RSA key
    ... Mike Amling wrote: ... Because the sieve does not have entries for integers divisible by 2? ... The algorithm described by Chen seems to have all the numbers from x to x+t. ...
    (sci.crypt)