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. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Damgård, I. B., Knudsen, L. R., & Thomsen, S. S. (2008). DAKOTA - Hashing from a combination of modular arithmetic and symmetric cryptography. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5037 LNCS, pp. 144–155). https://doi.org/10.1007/978-3-540-68914-0_9
Mendeley helps you to discover research relevant for your work.