Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Universal Hash Families and the Leftover Hash Lemma, and Applications to Cryptography and Computing

D.R. Stinson1
1Department of Combinatorics and Optimization University of Waterloo Waterloo Ontario, N2L 3G1, Canada
  • Published: 31/08/2002

Abstract

This paper is an expository treatment of the Leftover Hash Lemma and some of its applications in cryptography and complexity theory.

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
D.R. Stinson. Universal Hash Families and the Leftover Hash Lemma, and Applications to Cryptography and Computing[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 042. 3-31. DOI: .