Introduction to finite fields and their applications
Introduction to finite fields and their applications
A shift register construction of unconditionally secure authentication codes
Designs, Codes and Cryptography
An integrity check value algorithm for stream ciphers
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
On families of hash functions via geometric codes and concatenation
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
On the relation between A-codes and codes correcting independent errors
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Universal hashing and authentication codes
Designs, Codes and Cryptography
Fast Universal Hashing with Small Keys and No Preprocessing: The PolyR Construction
ICISC '00 Proceedings of the Third International Conference on Information Security and Cryptology
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
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
Energy Scalable Universal Hashing
IEEE Transactions on Computers
A New Algorithm for Inner Product
IEEE Transactions on Computers
Efficient tweakable enciphering schemes from (block-wise) universal hash functions
IEEE Transactions on Information Theory
Bucket hashing with a small key size
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
The Poly1305-AES message-authentication code
FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
Stronger security bounds for wegman-carter-shoup authenticators
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
The security and performance of the galois/counter mode (GCM) of operation
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
On the cardinality of systematic authentication codes via error-correcting codes
IEEE Transactions on Information Theory
Tweakable enciphering schemes using only the encryption function of a block cipher
Information Processing Letters
| Hi-index | 0.00 |
A new universal hash family is described which generalises a previously known multi-linear hash family. Messages are sequences over a finite field $${\mathbb{F}_q}$$ while keys are sequences over an extension field $${\mathbb{F}_{q^n}}$$ . A linear map $${\psi}$$ from $${\mathbb{F}_{q^n}}$$ to itself is used to compute the output digest. Of special interest is the case q = 2. For this case, we show that there is an efficient way to implement $${\psi}$$ using a tower field representation of $${\mathbb{F}_{q^n}}$$ . From a practical point of view, the focus of our constructions is small hardware and other resource constrained applications. For such platforms, our constructions compare favourably to previous work.