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

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

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

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

Aarhus University

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-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 language	English
Title of host publication	Applied Cryptography and Network Security 2008 : 6th International Conference, ACNS 2008, New York, NY, USA, June 3-6, 2008, Proceedings
Editors	Steven M. Bellovin, Rosario Gennaro, Angelos Keromytis, Moti Yung
Publisher	Springer
Publication date	2008
Pages	144-155
ISBN (Print)	978-3-540-68913-3
Publication status	Published - 2008
Event	6th International Conference on Applied Cryptography and Network Security - New York, NY, United States Duration: 3 Jun 2008 → 6 Jun 2008 Conference number: 6 http://acns2008.cs.columbia.edu/

Conference

Conference	6th International Conference on Applied Cryptography and Network Security
Number	6
Country/Territory	United States
City	New York, NY
Period	03/06/2008 → 06/06/2008
Internet address	http://acns2008.cs.columbia.edu/

Series	Lecture Notes in Computer Science
Number	5037

OpenUrl availability

Check availability in DTU Findit

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.

Damgård, Ivan Bjerre ; Knudsen, Lars Ramkilde ; Thomsen, Søren Steffen. / Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography. Applied Cryptography and Network Security 2008: 6th International Conference, ACNS 2008, New York, NY, USA, June 3-6, 2008, Proceedings. editor / Steven M. Bellovin ; Rosario Gennaro ; Angelos Keromytis ; Moti Yung. Springer, 2008. pp. 144-155 (Lecture Notes in Computer Science; No. 5037).

@inproceedings{56a9ef59192e4e9494a6abb2d5c85ee2,

title = "Dakota {\textendash} Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography",

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.",

author = "Damg{\aa}rd, \{Ivan Bjerre\} and Knudsen, \{Lars Ramkilde\} and Thomsen, \{S{\o}ren Steffen\}",

year = "2008",

language = "English",

isbn = "978-3-540-68913-3",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

number = "5037",

pages = "144--155",

editor = "Bellovin, \{Steven M.\} and Rosario Gennaro and Angelos Keromytis and Moti Yung",

booktitle = "Applied Cryptography and Network Security 2008",

note = "6th International Conference on Applied Cryptography and Network Security, ACNS 2008 ; Conference date: 03-06-2008 Through 06-06-2008",

url = "http://acns2008.cs.columbia.edu/",

}

Damgård, IB, Knudsen, LR & Thomsen, SS 2008, Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography. in SM 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. Springer, Lecture Notes in Computer Science, no. 5037, pp. 144-155, 6th International Conference on Applied Cryptography and Network Security, New York, NY, United States, 03/06/2008.

Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography. / Damgård, Ivan Bjerre; Knudsen, Lars Ramkilde; Thomsen, Søren Steffen.
Applied Cryptography and Network Security 2008: 6th International Conference, ACNS 2008, New York, NY, USA, June 3-6, 2008, Proceedings. ed. / Steven M. Bellovin; Rosario Gennaro; Angelos Keromytis; Moti Yung. Springer, 2008. p. 144-155 (Lecture Notes in Computer Science; No. 5037).

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

TY - GEN

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

N1 - Conference code: 6

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 - Article in proceedings

SN - 978-3-540-68913-3

T3 - Lecture Notes in Computer Science

SP - 144

EP - 155

BT - Applied Cryptography and Network Security 2008

A2 - Bellovin, Steven M.

A2 - Gennaro, Rosario

A2 - Keromytis, Angelos

A2 - Yung, Moti

PB - Springer

T2 - 6th International Conference on Applied Cryptography and Network Security

Y2 - 3 June 2008 through 6 June 2008

ER -

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

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

Abstract

Conference

OpenUrl availability

Fingerprint

Cite this