Kamel Bentahar, JH Silverman, M-j O Saarinen, NP Smart

    Research output: Contribution to conferencePaperpeer-review


    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.
    Original languageEnglish
    Publication statusPublished - 2006
    EventNIST Second Cryptographic Hash Workshop -
    Duration: 24 Aug 200625 Aug 2006


    ConferenceNIST Second Cryptographic Hash Workshop


    Dive into the research topics of 'Lash'. Together they form a unique fingerprint.

    Cite this