MRD Hashing

Authors:
R. Safavi-Naini;C. Charnes
Affiliations:
School of IT and CS, University of Wollongong, Wollongong, Australia 2522;School of Information Technology, Deakin University, Burwood, Australia 3125
Venue:
Designs, Codes and Cryptography
Year:
2005

Citing 8
Cited 1

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
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

Crypto topics and applications I

Algorithms and theory of computation handbook

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose two new classes of hash functions which are motivated by Maximum Rank Distance (MRD) codes. We analise the security of these schemes. The system setup phase is computationally expensive for general field extensions. To overcome this limitation we derive an algebraic solution which avoids computations in special extension fields in the intended operational range of the hash functions.