Follow @Openwall on Twitter for new release announcements and other news
[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Date: Thu, 18 Oct 2018 17:10:38 +0200
From: Jakub Wilk <>
Subject: Re: Travis CI MITM RCE

*, 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

Powered by blists - more mailing lists

Please check out the Open Source Software Security Wiki, which is counterpart to this mailing list.

Confused about mailing lists and their use? Read about mailing lists on Wikipedia and check out these guidelines on proper formatting of your messages.