Efficient strongly universal and optimally universal hashing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1672, Issue , 1999, Pages 262-272

  Woelfel, Phiupp ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIALS;

COMPOSITION TECHNIQUE; ITS APPLICATIONS; LINEAR FUNCTIONS; NEW CONSTRUCTIONS; RING OF POLYNOMIALS; UNIVERSAL HASH; UNIVERSAL HASHING;

HASH FUNCTIONS;

EID: 84949195621     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48340-3_24     Document Type: Conference Paper

References (19)

1. N. Alon, O. Goldreich, J. Håstad, and R. Peralta. Simple constructions of almost fc-wise independent random variables. Random Structures and Algorithms, 3:289-304, 1992.
2. N. Alon, O. Goldreich, J. Håstad, and R. Peralta. Addendum to ''simple constructions of almost A:-wise independent random variables". Random Structures and Algorithms, 4:119-120, 1993.
3. A. Andersson, T. Hagerup, S. Nilsson, and R. Raman. Sorting in linear time? In Proc. of 25th ACM STOC, pages 427-436, 1995.
4. J. L. Carter and M. N. Wegman. Universal classes of hash functions. J. Comp. Syst. Sei., 18:143-154, 1979.
5. M. Dietzfelbinger. Universal hashing and fc-wise independent random variables via integer arithmetic without primes. In Proc. of 13th STACS, pages 569-580, 1996.
6. M. Dietzfelbinger, T. Hagerup, J. Katajainen, and M. Penttonen. A reliable randomized algorithm for the closest-pair problem. J. Alg., 25:19-51, 1997.
7. M. Dietzfelbinger and M. Hühne. A dictionary implementation based on dynamic perfect hashing. Proc. of 5th DIMACS Chal. Worksh., 1996. To appear.
8. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. M. auf der Heide, H. Rohnert, and R. E. Tarjan. Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput., 23:738-761, 1994.
9. Engelmann and Keller. Simulation-based comparison of hash functions for emulated shared memory. In Proc. of 5th PARLE, pages 1-11, 1993.
10. M. L. Fredman, J. Komlós, and E. Szemerédi. Storing a sparse table with 0(1) worst case access time. J. Assoc. Comput. Mach., 31:538-544, 1984.
11. H. Krawczyk. LFSR-based hashing and authentication. In Advances in Cryptology - CRYPTO '94, pages 129-139, 1994.
12. Y. Matias and U. Vishkin. On parallel hashing and integer sorting. J. Algorithms, 12:573-606, 1991.
13. P. Rogaway. Bucket hashing and its application to fast message authentication. In Advances in Cryptology-CRYPTO '95, pages 29-42, 1995.
14. D. V. Sarwate. A note on universal classes of hash functions. Inf. Proc. Letters, 10:41-45, 1980.
15. A. Schönhage and V. Strassen. Schnelle Multiplikation großer Zahlen. Computing, 7:281-292, 1971.
16. D. R. Stinson. Combinatorial techniques for universal hashing. J. Comp. Syst. Sei., 48:337-346, 1994.
17. D. R. Stinson. On the connections between universal hashing, combinatorial designs and error-correcting codes. Report TR95-052, ECCC, ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/1995/TR95-052/Paper.ps, 1995.
18. M. N. Wegman and J. L. Carter. New classes and applications of hash functions. In Proc. of 20th IEEE FOCS, pages 175-182, 1979.
19. A. Wigderson. The amazing power of pairwise independence. In Proc. of 26th ACM STOC, pages 574-583, 1994.