Fast universal hashing with small keys and no preprocessing: The PolyR construction.
From MaRDI portal
Cited in
(7)- Symmetric blind information reconciliation and hash-function-based verification for quantum key distribution
- The circulant hash revisited
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
- Коды аутентификации с секретностью (обзор)
- A new multi-linear universal hash family
- The universality of iterated hashing over variable-length strings
- On Efficient Message Authentication Via Block Cipher Design Techniques
This page was built for publication: Fast universal hashing with small keys and no preprocessing: The PolyR construction.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2763025)