On the Minimum Number of Multiplications Necessary for Universal Hash Functions

DOI10.1007/978-3-662-46706-0_25zbMath1382.94146OpenAlexW2406249246MaRDI QIDQ2946925

Mridul Nandi

Publication date: 18 September 2015

Published in: Fast Software Encryption (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46706-0_25

zbMATH Keywords

multivariate polynomialVandermonde matrixerror correcting codeuniversal hashToeplitz hashAXU hash

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (3)

HalftimeHash: modern hashing without 64-bit multipliers or finite fields ⋮ Implicit key-stretching security of encryption schemes ⋮ On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers

This page was built for publication: On the Minimum Number of Multiplications Necessary for Universal Hash Functions