Second Preimages for Iterated Hash Functions and their Implications on MACs

Norbert Pramstaller; Mario Lamberger; Vincent Rijmen

doi:10.1007/978-3-540-73458-1_6

Second Preimages for Iterated Hash Functions and their Implications on MACs

Norbert Pramstaller, Mario Lamberger, Vincent Rijmen

Institute of Applied Information Processing and Communications (7050)

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

Abstract

In this article, we focus on second preimages for iterated hash functions. More precisely, we introduce the notion of a b-block bypass which is closely related to the notion of second preimage but specifies additional properties. We will then give two examples of iterated hash functions to which this notion applies: a double-block length hash function and a single-block length hash function. Furthermore, we look at NMAC and HMAC and show the implications of a b-block bypass regarding forgery attacks. As a result it turns out that the impact of second preimages for NMAC and HMAC heavily depends on how the second preimages are constructed.

Original language	English
Title of host publication	Information Security and Privacy. ACISP 2007
Subtitle of host publication	12th Australasian Conference, ACISP 2007, Townsville, Australia, July 2-4, 2007, Proceedings
Place of Publication	Berlin; Heidelberg
Publisher	Springer
Pages	68-81
ISBN (Print)	978-3-540-73457-4
DOIs	https://doi.org/10.1007/978-3-540-73458-1_6
Publication status	Published - 2007
Event	12th Australasian Conference on Information Security and Privacy: ACISP 2007 - Townsville, Australia Duration: 2 Jul 2007 → 4 Jul 2007

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	4586

Conference

Conference	12th Australasian Conference on Information Security and Privacy
Abbreviated title	ACISP 2007
Country/Territory	Australia
City	Townsville
Period	2/07/07 → 4/07/07

Access to Document

10.1007/978-3-540-73458-1_6

bypassTUGOnlineAccepted author manuscript, 210 KB

Cryptography
Schläffer, M. (Co-Investigator (CoI)), Oswald, M. E. (Co-Investigator (CoI)), Lipp, P. (Co-Investigator (CoI)), Dobraunig, C. E. (Co-Investigator (CoI)), Mendel, F. (Co-Investigator (CoI)), Eichlseder, M. (Co-Investigator (CoI)), Nad, T. (Co-Investigator (CoI)), Posch, R. (Co-Investigator (CoI)), Lamberger, M. (Co-Investigator (CoI)), Rijmen, V. (Co-Investigator (CoI)) & Rechberger, C. (Co-Investigator (CoI))
1/01/95 → 31/01/19
Project: Research area

Cite this

Pramstaller, N., Lamberger, M., & Rijmen, V. (2007). Second Preimages for Iterated Hash Functions and their Implications on MACs. In Information Security and Privacy. ACISP 2007: 12th Australasian Conference, ACISP 2007, Townsville, Australia, July 2-4, 2007, Proceedings (pp. 68-81). (Lecture Notes in Computer Science; Vol. 4586). Springer. https://doi.org/10.1007/978-3-540-73458-1_6

Second Preimages for Iterated Hash Functions and their Implications on MACs. / Pramstaller, Norbert; Lamberger, Mario; Rijmen, Vincent.
Information Security and Privacy. ACISP 2007: 12th Australasian Conference, ACISP 2007, Townsville, Australia, July 2-4, 2007, Proceedings. Berlin; Heidelberg: Springer, 2007. p. 68-81 (Lecture Notes in Computer Science; Vol. 4586).

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

Pramstaller, N, Lamberger, M & Rijmen, V 2007, Second Preimages for Iterated Hash Functions and their Implications on MACs. in Information Security and Privacy. ACISP 2007: 12th Australasian Conference, ACISP 2007, Townsville, Australia, July 2-4, 2007, Proceedings. Lecture Notes in Computer Science, vol. 4586, Springer, Berlin; Heidelberg, pp. 68-81, 12th Australasian Conference on Information Security and Privacy, Townsville, Australia, 2/07/07. https://doi.org/10.1007/978-3-540-73458-1_6

Pramstaller N, Lamberger M, Rijmen V. Second Preimages for Iterated Hash Functions and their Implications on MACs. In Information Security and Privacy. ACISP 2007: 12th Australasian Conference, ACISP 2007, Townsville, Australia, July 2-4, 2007, Proceedings. Berlin; Heidelberg: Springer. 2007. p. 68-81. (Lecture Notes in Computer Science). doi: 10.1007/978-3-540-73458-1_6

@inproceedings{1cd488155a234ce08a64e25a785a0ee4,

title = "Second Preimages for Iterated Hash Functions and their Implications on MACs",

abstract = "In this article, we focus on second preimages for iterated hash functions. More precisely, we introduce the notion of a b-block bypass which is closely related to the notion of second preimage but specifies additional properties. We will then give two examples of iterated hash functions to which this notion applies: a double-block length hash function and a single-block length hash function. Furthermore, we look at NMAC and HMAC and show the implications of a b-block bypass regarding forgery attacks. As a result it turns out that the impact of second preimages for NMAC and HMAC heavily depends on how the second preimages are constructed.",

author = "Norbert Pramstaller and Mario Lamberger and Vincent Rijmen",

year = "2007",

doi = "10.1007/978-3-540-73458-1_6",

language = "English",

isbn = "978-3-540-73457-4",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "68--81",

booktitle = "Information Security and Privacy. ACISP 2007",

note = "12th Australasian Conference on Information Security and Privacy : ACISP 2007, ACISP 2007 ; Conference date: 02-07-2007 Through 04-07-2007",

}

TY - GEN

T1 - Second Preimages for Iterated Hash Functions and their Implications on MACs

AU - Pramstaller, Norbert

AU - Lamberger, Mario

AU - Rijmen, Vincent

PY - 2007

Y1 - 2007

N2 - In this article, we focus on second preimages for iterated hash functions. More precisely, we introduce the notion of a b-block bypass which is closely related to the notion of second preimage but specifies additional properties. We will then give two examples of iterated hash functions to which this notion applies: a double-block length hash function and a single-block length hash function. Furthermore, we look at NMAC and HMAC and show the implications of a b-block bypass regarding forgery attacks. As a result it turns out that the impact of second preimages for NMAC and HMAC heavily depends on how the second preimages are constructed.

AB - In this article, we focus on second preimages for iterated hash functions. More precisely, we introduce the notion of a b-block bypass which is closely related to the notion of second preimage but specifies additional properties. We will then give two examples of iterated hash functions to which this notion applies: a double-block length hash function and a single-block length hash function. Furthermore, we look at NMAC and HMAC and show the implications of a b-block bypass regarding forgery attacks. As a result it turns out that the impact of second preimages for NMAC and HMAC heavily depends on how the second preimages are constructed.

U2 - 10.1007/978-3-540-73458-1_6

DO - 10.1007/978-3-540-73458-1_6

M3 - Conference paper

SN - 978-3-540-73457-4

T3 - Lecture Notes in Computer Science

SP - 68

EP - 81

BT - Information Security and Privacy. ACISP 2007

PB - Springer

CY - Berlin; Heidelberg

T2 - 12th Australasian Conference on Information Security and Privacy

Y2 - 2 July 2007 through 4 July 2007

ER -

Second Preimages for Iterated Hash Functions and their Implications on MACs

Abstract

Publication series

Conference

Access to Document

Fingerprint

Projects

Cryptography

Cite this