A trade-off between collision probability and key size in universal hashing using polynomials
From MaRDI portal
Publication:2430412
DOI10.1007/s10623-010-9408-6zbMath1215.68098MaRDI QIDQ2430412
Publication date: 6 April 2011
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-010-9408-6
94A60: Cryptography
68P25: Data encryption (aspects in computer science)
94A62: Authentication, digital signatures and secret sharing
Related Items
The universality of iterated hashing over variable-length strings, Modes of operations for encryption and authentication using stream ciphers supporting an initialisation vector
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A general mixing strategy for the ECB-Mix-ECB mode of operation
- New hash functions and their use in authentication and set equality
- Universal classes of hash functions
- Bucket hashing and its application to fast message authentication
- Universal hashing and authentication codes
- On Fast and Provably Secure Message Authentication Based on Universal Hashing
- Codes Which Detect Deception
- MMH: Software message authentication in the Gbit/second rates
- Fast Software Encryption
- Fast evaluation of polynomials by rational preparation