Introduction to finite fields and their applications
Introduction to finite fields and their applications
Universal hashing and authentication codes
Designs, Codes and Cryptography
Authentication codes for nontrusting parties obtained from rank metric codes
Designs, Codes and Cryptography
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
A New Identification Algorithm
Proceedings of the International Conference on Cryptography: Policy and Algorithms
The Shrinking Generator: Some Practical Considerations
Fast Software Encryption, Cambridge Security Workshop
On the security of two MAC algorithms
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
New hash functions for message authentication
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
| Hi-index | 0.00 |
We propose two new classes of hash functions inspired by Maximum Rank Distance (MRD) codes. We analyze the security and describe efficient hardware and software implementations of these schemes. In general, the system setup remains computationally expensive. However, for a special class of parameters we show that this computation can be completely avoided.