[ratelimits] Remarks regarding the Knot DNS 1.2.0 RRL implementation
cet1 at cam.ac.uk
Tue Mar 5 20:12:54 UTC 2013
On Mar 5 2013, Vernon Schryver wrote:
>It sounds like the popular crypto hash function mistake. The virtues
>of cryptographic hash functions are unrelated to their collision
Not *completely* unrelated. A cryptographic hash that produced a particular
result a significant proportion of the time (you can imagine the reductio
ad absurdum case I am thinking of) would certainly be vulnerable to a (1st
or 2nd) pre-image attack.
Chris Thompson University of Cambridge Computing Service,
Email: cet1 at ucs.cam.ac.uk New Museums Site, Cambridge CB2 3QH,
Phone: +44 1223 334715 United Kingdom.
More information about the ratelimits