# Difference between revisions of "LASH-n"

From The ECRYPT Hash Function Website

Mschlaeffer (talk | contribs) |
Mschlaeffer (talk | contribs) |
||

Line 15: | Line 15: | ||

year = {2006}, | year = {2006}, | ||

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.}, | 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.}, | ||

− | url = {http://csrc.nist.gov/groups/ST/hash/second_workshop.html} | + | url = {http://csrc.nist.gov/groups/ST/hash/second_workshop.html} |

} | } | ||

<\bibtex> | <\bibtex> |

## Revision as of 11:06, 10 March 2008

## Contents

## 1 Spezification

<bibtex> @MISC{nistBentaharPSSS06,

author = {Kamel Bentahar and Dan Page and Markku-Juhani O. Saarinen and Joseph H. Silverman and Nigel Smart}, title = {LASH}, howpublished = {NIST - Second Cryptographic Hash Workshop, August 24-25}, year = {2006}, 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.}, url = {http://csrc.nist.gov/groups/ST/hash/second_workshop.html}

} <\bibtex>