Software Performance of Universal Hash Functions
نویسندگان
چکیده
This paper compares the parameters sizes and software performance of several recent constructions for universal hash functions: bucket hashing, polynomial hashing, Toeplitz hashing, division hashing, evaluation hashing, and MMH hashing. An objective comparison between these widely varying approaches is achieved by defining constructions that offer a comparable security level. It is also demonstrated how the security of these constructions compares favorably to existing MAC algorithms, the security of which is less understood.
منابع مشابه
Double Hashing Is Computable and Randomizable with Universal Hash Functions
Universal hash functions that exhibit clog n-wise independence are shown to give a performance in double hashing and virtually any reasonable generalization of double hashing that has an expected probe count of 1 1? + for the insertion of the n-th item into a table of size n, for any xed < 1 and > 0. This performance is within of optimal. These results are derived from a novel formulation that ...
متن کاملUniversal Hash Functions from Exponential Sums over Finite Fields and Galois Rings
In t#liis 1)apcr ncw families o f stmngly universal hash funct,ions, or equivalently, authentication codes, are proposed. Their parameters are derived from bounds on exponential sums over finite fields and Galois rings. This is the first tirnr hash families based upon such exponential sums have 1)een considered. Thi>ir performance improves the previously best known c.oiist,ructions and they rai...
متن کاملKeyed Hash Functions
We give a new deenition of keyed hash functions and show its relation with strongly universal hash functions and Cartesian authenti-cation codes. We propose an algorithm for a secure keyed hash function and present preliminary result on its performance. The algorithm can be used for fast (about twice the speed of MD5) and secure message authentication.
متن کاملRegular and almost universal hashing: an efficient implementation
Random hashing can provide guarantees regarding the performance of data structures such as hash tables— even in an adversarial setting. Many existing families of hash functions are universal: given two data objects, the probability that they have the same hash value is low given that we pick hash functions at random. However, universality fails to ensure that all hash functions are well behaved...
متن کاملClosed hashing is computable and optimally randomizable with universal hash functions
Universal hash functions that exhibit clog n-wise independence are shown to give a performance in double hashing, uniform hashing and virtually any reasonable generalization of double hashing that has an expected probe count of 1 1? +O(1 n) for the insertion of the n-th item into a table of size n, for any xed < 1. This performance is optimal. These results are derived from a novel formulation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999