Re: Travis CI MITM RCE

[Jakub Wilk <jwilk () jwilk net>]

* zugtprgfwprz () spornkuller de, 2018-08-31, 22:25:
> I.e., my point was that for a given key that's uploaded with a fixed 
> fingerprint, we're not talking about 2^(b/2) collision complexity, but 
> 2^(b-1) second preimage complexity.

Nitpicking, but for an ideal n-bit hash function, on avergage you need 
2ⁿ (not 2ⁿ⁻¹) evalutations of the function to find the preimage.

--
Jakub Wilk