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.
Support for this project was partly provided by Australian Research Council.