Research output: Contribution to conference › Paper

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.

2006. Paper presented at NIST Second Cryptographic Hash Workshop, .

Research output: Contribution to conference › Paper

Bentahar, K, Silverman, JH, Saarinen, MO & Smart, NP 2006, 'Lash' Paper presented at NIST Second Cryptographic Hash Workshop, 24/08/06 - 25/08/06, .

Bentahar K, Silverman JH, Saarinen MO, Smart NP. Lash. 2006. Paper presented at NIST Second Cryptographic Hash Workshop, .

Bentahar, Kamel ; Silverman, JH ; Saarinen, M-j O ; Smart, NP. / Lash. Paper presented at NIST Second Cryptographic Hash Workshop, .

@conference{03a6867f28a048039939eb2170836498,

title = "Lash",

abstract = "We present a practical cryptographic hashfunction based on the Miyaguchi–Preneel construction,which instead of using a block cipher as the main componentuses a modular matrix multiplication. Thus as the corecomponent it uses a compression function which is closelyrelated to the theoretical lattice based hash function consideredby Goldreich, Goldwasser and Halevi. We show that bysuitable parameter choices we can produce a hash functionwhich is comparable in performance to existing deployedhash functions such as SHA-1 and SHA-2.",

author = "Kamel Bentahar and JH Silverman and Saarinen, {M-j O} and NP Smart",

year = "2006",

language = "English",

note = "NIST Second Cryptographic Hash Workshop ; Conference date: 24-08-2006 Through 25-08-2006",

}

TY - CONF

T1 - Lash

AU - Bentahar, Kamel

AU - Silverman, JH

AU - Saarinen, M-j O

AU - Smart, NP

PY - 2006

Y1 - 2006

N2 - We present a practical cryptographic hashfunction based on the Miyaguchi–Preneel construction,which instead of using a block cipher as the main componentuses a modular matrix multiplication. Thus as the corecomponent it uses a compression function which is closelyrelated to the theoretical lattice based hash function consideredby Goldreich, Goldwasser and Halevi. We show that bysuitable parameter choices we can produce a hash functionwhich is comparable in performance to existing deployedhash functions such as SHA-1 and SHA-2.

AB - We present a practical cryptographic hashfunction based on the Miyaguchi–Preneel construction,which instead of using a block cipher as the main componentuses a modular matrix multiplication. Thus as the corecomponent it uses a compression function which is closelyrelated to the theoretical lattice based hash function consideredby Goldreich, Goldwasser and Halevi. We show that bysuitable parameter choices we can produce a hash functionwhich is comparable in performance to existing deployedhash functions such as SHA-1 and SHA-2.