Dakota - hashing from a combination of modular arithmetic and symmetric cryptography

Ivan Bjerre Damgård, Lars Ramkilde Knudsen, Søren Steffen Thomsen

    Research output: Book/ReportReportResearch

    Abstract

    In this paper a cryptographic hash function is proposed, where collision resistance is based upon an assumption that involves squaring modulo an RSA modulus in combination with a one-way function that does not compress its input, and may therefore be constructed from standard techniques and assumptions. We are not able to reduce collision finding to factoring, but on the other hand, our hash function is more efficient than any known construction that makes use of modular squaring.
    Original languageEnglish
    PublisherTechnical University of Denmark
    Number of pages10
    Publication statusPublished - 2008
    SeriesMAT report
    Number2008-02

    Cite this

    Damgård, I. B., Knudsen, L. R., & Thomsen, S. S. (2008). Dakota - hashing from a combination of modular arithmetic and symmetric cryptography. Technical University of Denmark. MAT report, No. 2008-02