On Wed, Dec 5, 2012 at 6:20 PM, Theodore Ts'o 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
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 corr
On Wed, Dec 5, 2012 at 11:19 AM, 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
> op
Hi,
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] htt
4 matches
Mail list logo
