On 2013-02-19 23:05, Michael Rogers wrote:
based on the first 80 bits of the hash of the service's public key, so a collision can be generated after an expected 2^80 attempts.
Some nitpicking: with the birthday attack you can find collisions on a n-bit hash function using 2^(n/2) evaluations with probability > 1/2. This means, you only need 2^40 attempts to find collisions with a probability higher than 1/2.
-- Kjell _______________________________________________ OTR-dev mailing list [email protected] http://lists.cypherpunks.ca/mailman/listinfo/otr-dev
