Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography

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

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    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
    Title of host publicationApplied Cryptography and Network Security 2008 : 6th International Conference, ACNS 2008, New York, NY, USA, June 3-6, 2008, Proceedings
    EditorsSteven M. Bellovin, Rosario Gennaro, Angelos Keromytis, Moti Yung
    PublisherSpringer
    Publication date2008
    Pages144-155
    ISBN (Print)978-3-540-68913-3
    Publication statusPublished - 2008
    Event6th International Conference on Applied Cryptography and Network Security - New York, NY, United States
    Duration: 3 Jun 20086 Jun 2008
    Conference number: 6
    http://acns2008.cs.columbia.edu/

    Conference

    Conference6th International Conference on Applied Cryptography and Network Security
    Number6
    CountryUnited States
    CityNew York, NY
    Period03/06/200806/06/2008
    Internet address
    SeriesLecture Notes in Computer Science
    Number5037

    Cite this

    Damgård, I. B., Knudsen, L. R., & Thomsen, S. S. (2008). Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography. In S. M. Bellovin, R. Gennaro, A. Keromytis, & M. Yung (Eds.), Applied Cryptography and Network Security 2008: 6th International Conference, ACNS 2008, New York, NY, USA, June 3-6, 2008, Proceedings (pp. 144-155). Springer. Lecture Notes in Computer Science, No. 5037