TY - RPRT
T1 - Dakota - hashing from a combination of modular arithmetic and symmetric cryptography
AU - Damgård, Ivan Bjerre
AU - Knudsen, Lars Ramkilde
AU - Thomsen, Søren Steffen
PY - 2008
Y1 - 2008
N2 - 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.
AB - 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.
M3 - Report
T3 - MAT report
BT - Dakota - hashing from a combination of modular arithmetic and symmetric cryptography
PB - Technical University of Denmark
ER -