Universal hash functions are not hard to implement. Just dot-product with a random vector or evaluate as a polynomial at a random point. However, you need to be careful in using them to fight complexity attacks. An adversary who can make careful timing measurements of your system might find the hash key, and then use it to make just as many collisions.
Read full article from (9) How does one implement a universal hash function, and would this be feasible to use, for example, in a filesystem's dentry table? - Quora
No comments:
Post a Comment