We present a practical cryptographic hash function based on the Miyaguchi--Preneel construction, which instead of using a block cipher as the main component uses a modular matrix multiplication. Thus as the core component it uses a compression function which is closely related to the theoretical lattice based hash function considered by Goldreich, Goldwasser and Halevi. We show that by suitable parameter choices we can produce a hash function which is comparable in performance to existing deployed hash functions such as SHA-1 and SHA-2.
|Title of host publication||NIST: The Second Cryptographic Hash Workshop|
|Publication status||Published - 2006|