The computational complexity of universal hashing

Yishay Mansour; Noam Nisan; Prasoon Tiwari

doi:10.1016/0304-3975(93)90257-T

The computational complexity of universal hashing

Yishay Mansour^*, Noam Nisan, Prasoon Tiwari

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

98 Scopus citations

Abstract

Any implementation of Carter-Wegman universal hashing from n-bit strings to m-bit strings requires a time-space tradeoff of TS=Ω(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; Ω(logn) parallel time bound on a CREW PRAM; and exponential size for constant-depth circuits.

Original language	English
Pages (from-to)	121-133
Number of pages	13
Journal	Theoretical Computer Science
Volume	107
Issue number	1
DOIs	https://doi.org/10.1016/0304-3975(93)90257-T
State	Published - 4 Jan 1993

Bibliographical note

Funding Information:
* Supported by an IBM graduate fellowship. ** Research was done while the author was at Laboratory for Computer Science, MIT, 545 Tech. Sq., Cambridge, MA 02139, USA. Partially supported by NSF 865727-CCR and AR0 DALL03-86-K-017. *** This work was performed while the author was at IBM Research Division, T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598, USA.

Access to Document

10.1016/0304-3975(93)90257-T

Cite this

@article{c1c74c4079b64d8d942363f97ff82134,

title = "The computational complexity of universal hashing",

abstract = "Any implementation of Carter-Wegman universal hashing from n-bit strings to m-bit strings requires a time-space tradeoff of TS=Ω(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 AT2 bound for VLSI implementation; Ω(logn) parallel time bound on a CREW PRAM; and exponential size for constant-depth circuits.",

author = "Yishay Mansour and Noam Nisan and Prasoon Tiwari",

note = "Funding Information: * Supported by an IBM graduate fellowship. ** Research was done while the author was at Laboratory for Computer Science, MIT, 545 Tech. Sq., Cambridge, MA 02139, USA. Partially supported by NSF 865727-CCR and AR0 DALL03-86-K-017. *** This work was performed while the author was at IBM Research Division, T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598, USA.",

year = "1993",

month = jan,

day = "4",

doi = "10.1016/0304-3975(93)90257-T",

language = "אנגלית",

volume = "107",

pages = "121--133",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - The computational complexity of universal hashing

AU - Mansour, Yishay

AU - Nisan, Noam

AU - Tiwari, Prasoon

N1 - Funding Information: * Supported by an IBM graduate fellowship. ** Research was done while the author was at Laboratory for Computer Science, MIT, 545 Tech. Sq., Cambridge, MA 02139, USA. Partially supported by NSF 865727-CCR and AR0 DALL03-86-K-017. *** This work was performed while the author was at IBM Research Division, T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598, USA.

PY - 1993/1/4

Y1 - 1993/1/4

N2 - Any implementation of Carter-Wegman universal hashing from n-bit strings to m-bit strings requires a time-space tradeoff of TS=Ω(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 AT2 bound for VLSI implementation; Ω(logn) parallel time bound on a CREW PRAM; and exponential size for constant-depth circuits.

AB - Any implementation of Carter-Wegman universal hashing from n-bit strings to m-bit strings requires a time-space tradeoff of TS=Ω(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 AT2 bound for VLSI implementation; Ω(logn) parallel time bound on a CREW PRAM; and exponential size for constant-depth circuits.

UR - http://www.scopus.com/inward/record.url?scp=38149074447&partnerID=8YFLogxK

U2 - 10.1016/0304-3975(93)90257-T

DO - 10.1016/0304-3975(93)90257-T

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:38149074447

SN - 0304-3975

VL - 107

SP - 121

EP - 133

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 1

ER -

The computational complexity of universal hashing

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this