On Wed, Dec 5, 2012 at 6:20 PM, Theodore Ts'o <ty...@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 -- To unsubscribe from this list: send the line "unsubscribe git" in the body of a message to majord...@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html
