Fast universal hashing with small keys and no preprocessing : The PolyR construction

Conference proceeding

Peer reviewed

Ted KROVETZ and Phillip ROGAWAY

Lecture notes in computer science, Vol.2015, pp.73-89

Information security and cryptology (Seoul, 8-9 December 2000)

2001

Handle:

https://hdl.handle.net/20.500.12741/rep:7256

Abstract

Signal and communications theory

Applied sciences

Information, signal and communications theory

Cryptography

Telecommunications and information theory

Exact sciences and technology

10 Record Views

Title: Fast universal hashing with small keys and no preprocessing : The PolyR construction
Creators: Ted KROVETZ - Department of Computer Science, University of California, Davis CA 95616, United States
Phillip ROGAWAY - Department of Computer Science, University of California, Davis CA 95616, United States
Academic Unit: Computer Science Department
Publisher: Springer
Publication Details: 2001
Conference: Information security and cryptology (Seoul, 8-9 December 2000)
Identifiers: 99257877136101671; https://hdl.handle.net/20.500.12741/rep:7256; https://doi.org/10.1007/3-540-45247-8_7
Language: English