The computational complexity of universal hashing

Mansour, Y., N. Nisan and P. Tiwari, The computational complexity of universal hashing, Theoretical Computer Science 107 (1993) 121-133. Any implementation of Carter-Wegman universal hashing from n-bit strings to m-bit strings requires a time-space tradeoff of TS=n(nm). The bound holds in the general boolean branching program model and, thus, in essentially any model of computation. As a corollary, computing a+ b * c in any field F requires a quadratic time-space tradeoff, and the bound holds for any representation of the elements of the field. Other lower bounds on the complexity of any implementation of universal hashing are given as well: quadratic AT’ bound for VLSI implementation; R(logn) parallel time bound on a CREW PRAM; and exponential size for constant-depth circuits.

[1]  V. M. Khrapchenko Method of determining lower bounds for the complexity of P-schemes , 1971 .

[2]  J. Spencer Probabilistic Methods in Combinatorics , 1974 .

[3]  Allan Borodin,et al.  A time-space tradeoff for sorting on non-oblivious machines , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[4]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

[5]  C. Thomborson,et al.  A Complexity Theory for VLSI , 1980 .

[6]  Martin Tompa Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits , 1980, J. Comput. Syst. Sci..

[7]  Andrew Chi-Chih Yao,et al.  The entropic limitations on VLSI computations(Extended Abstract) , 1981, STOC '81.

[8]  Allan Borodin,et al.  A Time-Space Tradeoff for Sorting on Non-Oblivious Machines , 1981, J. Comput. Syst. Sci..

[9]  Allan Borodin,et al.  A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation , 1982, SIAM J. Comput..

[10]  Michael Sipser,et al.  A complexity theoretic approach to randomness , 1983, STOC.

[11]  Allan Borodin,et al.  Parallel Computation for Well-Endowed Rings and Space-Bounded Probabilistic Machines , 1984, Inf. Control..

[12]  Yaacov Yesha,et al.  Time-Space Tradeoffs for Matrix Multiplication and the Discrete Fourier Transform on any General Sequential Random-Access Computer , 1984, J. Comput. Syst. Sci..

[13]  Stephen A. Cook,et al.  Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes , 1986, SIAM J. Comput..

[14]  Shafi Goldwasser,et al.  Private coins versus public coins in interactive proof systems , 1986, STOC '86.

[15]  Karl R. Abrahamson Time-space tradeoffs for branching programs contrasted with those for straight-line programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[16]  Prasoon Tiwari The communication complexity of distributed computing and a parallel algorithm for polynomial roots , 1986 .

[17]  Peter Frankl,et al.  Complexity classes in communication complexity theory , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[18]  Noam Nisan,et al.  Constant depth circuits, Fourier transform, and learnability , 1989, 30th Annual Symposium on Foundations of Computer Science.

[19]  Russell Impagliazzo,et al.  How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.

[20]  Alan Siegel,et al.  On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications , 1989, 30th Annual Symposium on Foundations of Computer Science.

[21]  Tak Wah Lam,et al.  Tradeoffs between communication and space , 1989, STOC '89.

[22]  Ravi B. Boppana,et al.  The Complexity of Finite Functions , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[23]  Paul Beame A General Sequential Time-Space Tradeoff for Finding Unique Elements , 1991, SIAM J. Comput..