Message authentication with one-way hash functions
ACM SIGCOMM Computer Communication Review
UMAC: Fast and Secure Message Authentication
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
LFSR-based Hashing and Authentication
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Bucket Hashing and its Application to Fast Message Authentication
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
On Fast and Provably Secure Message Authentication Based on Universal Hashing
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
MMH: Software Message Authentication in the Gbit/Second Rates
FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
Fast Message Authentication Using Efficient Polynomial Evaluation
FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
Message authentication on 64-bit architectures
SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
Square hash with a small key size
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
An analysis of proxy signatures: is a secure channel necessary?
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
On efficient message authentication via block cipher design techniques
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
The Poly1305-AES message-authentication code
FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
The universality of iterated hashing over variable-length strings
Discrete Applied Mathematics
Short-Output universal hash functions and their use in fast and secure data authentication
FSE'12 Proceedings of the 19th international conference on Fast Software Encryption
CHES'12 Proceedings of the 14th international conference on Cryptographic Hardware and Embedded Systems
A new multi-linear universal hash family
Designs, Codes and Cryptography
| Hi-index | 0.01 |
We describe a universal hash-function family, PolyR, which hashes messages of effectively arbitrary lengths in 3.9-6.9 cycles/byte (cpb) on a Pentium II (achieving a collision probability in the range 2-16-2-50). Unlike most proposals, PolyR actually hashes short messages faster (per byte) than long ones. At the same time, its key is only a few bytes, the output is only a few bytes, and no "preprocessing" is needed to achieve maximal efficiency. Our designs have been strongly influenced by low-level considerations relevant to software speed, and experimental results are given throughout.