# Difference between revisions of "LASH-n"

From The ECRYPT Hash Function Website

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

Line 1: | Line 1: | ||

== Spezification == | == Spezification == | ||

− | |||

* digest size: 160 bits | * digest size: 160 bits | ||

* max. message length: < 2<sup>64</sup> bits | * max. message length: < 2<sup>64</sup> bits | ||

* compression function: 512-bit message block, 160-bit chaining variable | * compression function: 512-bit message block, 160-bit chaining variable | ||

− | * Specification: | + | * Specification: http://csrc.nist.gov/groups/ST/hash/documents/SAARINEN_lash4-1_ORIG.pdf |

− | - | ||

<bibtex> | <bibtex> | ||

Line 15: | Line 13: | ||

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/ | + | url = {http://csrc.nist.gov/groups/ST/hash/documents/SAARINEN_lash4-1_ORIG.pdf}, |

} | } | ||

</bibtex> | </bibtex> |

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

## Contents

## 1 Spezification

- digest size: 160 bits
- max. message length: < 2
^{64}bits - compression function: 512-bit message block, 160-bit chaining variable
- Specification: http://csrc.nist.gov/groups/ST/hash/documents/SAARINEN_lash4-1_ORIG.pdf

*Kamel Bentahar, Dan Page, Markku-Juhani O. Saarinen, Joseph H. Silverman, Nigel Smart* - **LASH**

- ,2006
- http://csrc.nist.gov/groups/ST/hash/documents/SAARINEN_lash4-1_ORIG.pdf

Bibtex**Author :**Kamel Bentahar, Dan Page, Markku-Juhani O. Saarinen, Joseph H. Silverman, Nigel Smart**Title :**LASH**In :**-**Address :****Date :**2006