On Wed, Dec 05, 2012 at 10:19:43AM +0100, Sebastian Schuberth wrote:
>
> to say it in advance: I do not want to trigger any bogus security
> discussion here. Instead, I believe the findings from [1] allow for
> an up to 20% faster SHA1 calculation, if my brief reading of the
> presentation is correct. Any opinions on integration this
> optimization into Git?
>
> [1] https://hashcat.net/p12/js-sha1exp_169.pdf
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.
Regards,
- Ted
--
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
