From: Sebastian Schuberth <sschuberth@gmail.com>
Date: Thu, 06 Dec 2012 08:11:29 GMT
Subject: Re: Exploiting SHA1's "XOR weakness" allows for faster hash calculation
Message-ID: <CAHGBnuN1AwjAFeJMizXu9e-iD3n1GuWMNm9OPxCH7t1BcGz8Rw@mail.gmail.com>
In-Reply-To: <20121205172011.GH18885@thunk.org>

On Wed, Dec 5, 2012 at 6:20 PM, Theodore Ts'o <tytso@mit.edu> wrote:

> It's only useful if you are trying to do brute-force password
> cracking, where the password is being hashed in a very specific way.
> (If for example the password was replicated N times in the input
> buffer for SHA-1, instead of keeping the padding constant in the rest
> of theinput buffer, this particular optimization would't apply.)
>
> In any case, it's not at all applicable for general purpose checksum
> calculations, and hence wouldn't apply to git.

Thanks for the explanation.

-- 
Sebastian Schuberth