Bucket hashing and its application to fast message authentication
From MaRDI portal
Publication:1291805
DOI10.1007/PL00003822zbMATH Open0937.94011OpenAlexW2022640260MaRDI QIDQ1291805FDOQ1291805
Authors: Phillip Rogaway
Publication date: 6 June 2000
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00003822
Recommendations
Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Cited In (15)
- The circulant hash revisited
- Fast message authentication using efficient polynomial evaluation
- The universality of iterated hashing over variable-length strings
- Title not available (Why is that?)
- Tight security of cascaded LRW2
- SipHash: a fast short-input PRF
- A construction method for optimally universal hash families and its consequences for the existence of RBIBDs
- Title not available (Why is that?)
- Analysis of the Initial and Modified Versions of the Candidate 3GPP Integrity Algorithm 128-EIA3
- A trade-off between collision probability and key size in universal hashing using polynomials
- Badger – A Fast and Provably Secure MAC
- Secure mutual authentication quantum key agreement scheme for two-party setting with key recycling
- A new multi-linear universal hash family
- Title not available (Why is that?)
- \(\Gamma\)-MAC\([H,P]\) -- a new universal MAC scheme
This page was built for publication: Bucket hashing and its application to fast message authentication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1291805)