Damgård, Ivan Bjerre

Knudsen, Lars Ramkilde

Thomsen, Søren Steffen

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

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

Abstract

Similar works

Full text

Available Versions

Online Research Database In Technology

Online Research Database In Technology