Abstract
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.
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.
| Original language | English |
|---|---|
| Publication status | Published - 2006 |
| Event | NIST Second Cryptographic Hash Workshop - Duration: 24 Aug 2006 → 25 Aug 2006 |
Conference
| Conference | NIST Second Cryptographic Hash Workshop |
|---|---|
| Period | 24/08/06 → 25/08/06 |