Optimal Covering Codes for Finding Near-Collisions

Mario Lamberger; Vincent Rijmen

doi:10.1007/978-3-642-19574-7_13

Optimal Covering Codes for Finding Near-Collisions

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

Recently, a new generic method to find near-collisions for cryptographic hash functions in a memoryless way has been proposed. This method is based on classical cycle-finding techniques and covering codes. This paper contributes to the coding theory aspect of this method by giving the optimal solution to a problem which arises when constructing a suitable code as the direct sum of Hamming and trivial codes.

Original language	English
Title of host publication	Selected Areas in Cryptography
Subtitle of host publication	17th International Workshop, SAC 2010, Waterloo, Ontario, Canada, August 12-13, 2010, Revised Selected Papers
Editors	Alex Biryukov, Guang Gong, Douglas R. Stinson
Place of Publication	Berlin; Heidelberg
Publisher	Springer
Pages	187-197
ISBN (Print)	978-3-642-19573-0
DOIs	https://doi.org/10.1007/978-3-642-19574-7_13
Publication status	Published - 2010
Event	17th International Workshop on Selected Areas in Cryptography -: SAC 2010 - Waterloo, Canada Duration: 12 Aug 2010 → 13 Aug 2010

Publication series

Name	Lecture Notes in Computer Science
Volume	6544

Workshop

Workshop	17th International Workshop on Selected Areas in Cryptography -
Abbreviated title	SAC 2010
Country/Territory	Canada
City	Waterloo
Period	12/08/10 → 13/08/10

Fields of Expertise

Information, Communication & Computing

Access to Document

10.1007/978-3-642-19574-7_13

FWF - kryptographische Hashfu - Cryptanalysis of modern cryptographic hash functions II
Nad, T., Mendel, F., Schläffer, M., Lamberger, M. & Rijmen, V.
1/02/10 → 31/01/13
Project: Research project
EU - ECRYPT II - European network of excellence in cryptology - Phase II
Schmidt, J., Nad, T., Kirschbaum, M., Feldhofer, M., Schläffer, M., Aigner, M. J., Rechberger, C., Lamberger, M., Tillich, S., Medwed, M., Hutter, M., Rijmen, V., Mendel, F. & Posch, R.
1/08/08 → 31/01/13
Project: Research project
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

Lamberger, M., & Rijmen, V. (2010). Optimal Covering Codes for Finding Near-Collisions. In A. Biryukov, G. Gong, & D. R. Stinson (Eds.), Selected Areas in Cryptography: 17th International Workshop, SAC 2010, Waterloo, Ontario, Canada, August 12-13, 2010, Revised Selected Papers (pp. 187-197). ( Lecture Notes in Computer Science ; Vol. 6544). Springer. https://doi.org/10.1007/978-3-642-19574-7_13

Optimal Covering Codes for Finding Near-Collisions. / Lamberger, Mario; Rijmen, Vincent.
Selected Areas in Cryptography: 17th International Workshop, SAC 2010, Waterloo, Ontario, Canada, August 12-13, 2010, Revised Selected Papers. ed. / Alex Biryukov; Guang Gong; Douglas R. Stinson. Berlin; Heidelberg: Springer, 2010. p. 187-197 ( Lecture Notes in Computer Science ; Vol. 6544).

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

Lamberger, M & Rijmen, V 2010, Optimal Covering Codes for Finding Near-Collisions. in A Biryukov, G Gong & DR Stinson (eds), Selected Areas in Cryptography: 17th International Workshop, SAC 2010, Waterloo, Ontario, Canada, August 12-13, 2010, Revised Selected Papers. Lecture Notes in Computer Science , vol. 6544, Springer, Berlin; Heidelberg, pp. 187-197, 17th International Workshop on Selected Areas in Cryptography -, Waterloo, Canada, 12/08/10. https://doi.org/10.1007/978-3-642-19574-7_13

Lamberger M, Rijmen V. Optimal Covering Codes for Finding Near-Collisions. In Biryukov A, Gong G, Stinson DR, editors, Selected Areas in Cryptography: 17th International Workshop, SAC 2010, Waterloo, Ontario, Canada, August 12-13, 2010, Revised Selected Papers. Berlin; Heidelberg: Springer. 2010. p. 187-197. ( Lecture Notes in Computer Science ). doi: 10.1007/978-3-642-19574-7_13

Lamberger, Mario ; Rijmen, Vincent. / Optimal Covering Codes for Finding Near-Collisions. Selected Areas in Cryptography: 17th International Workshop, SAC 2010, Waterloo, Ontario, Canada, August 12-13, 2010, Revised Selected Papers. editor / Alex Biryukov ; Guang Gong ; Douglas R. Stinson. Berlin; Heidelberg : Springer, 2010. pp. 187-197 ( Lecture Notes in Computer Science ).

@inproceedings{ddb613b017da431a93adc6b3738c3604,

title = "Optimal Covering Codes for Finding Near-Collisions",

abstract = "Recently, a new generic method to find near-collisions for cryptographic hash functions in a memoryless way has been proposed. This method is based on classical cycle-finding techniques and covering codes. This paper contributes to the coding theory aspect of this method by giving the optimal solution to a problem which arises when constructing a suitable code as the direct sum of Hamming and trivial codes.",

author = "Mario Lamberger and Vincent Rijmen",

year = "2010",

doi = "10.1007/978-3-642-19574-7_13",

language = "English",

isbn = "978-3-642-19573-0",

series = " Lecture Notes in Computer Science ",

publisher = "Springer",

pages = "187--197",

editor = "Alex Biryukov and Guang Gong and Stinson, {Douglas R.}",

booktitle = "Selected Areas in Cryptography",

note = "17th International Workshop on Selected Areas in Cryptography - : SAC 2010, SAC 2010 ; Conference date: 12-08-2010 Through 13-08-2010",

}

TY - GEN

T1 - Optimal Covering Codes for Finding Near-Collisions

AU - Lamberger, Mario

AU - Rijmen, Vincent

PY - 2010

Y1 - 2010

N2 - Recently, a new generic method to find near-collisions for cryptographic hash functions in a memoryless way has been proposed. This method is based on classical cycle-finding techniques and covering codes. This paper contributes to the coding theory aspect of this method by giving the optimal solution to a problem which arises when constructing a suitable code as the direct sum of Hamming and trivial codes.

AB - Recently, a new generic method to find near-collisions for cryptographic hash functions in a memoryless way has been proposed. This method is based on classical cycle-finding techniques and covering codes. This paper contributes to the coding theory aspect of this method by giving the optimal solution to a problem which arises when constructing a suitable code as the direct sum of Hamming and trivial codes.

U2 - 10.1007/978-3-642-19574-7_13

DO - 10.1007/978-3-642-19574-7_13

M3 - Conference paper

SN - 978-3-642-19573-0

T3 - Lecture Notes in Computer Science

SP - 187

EP - 197

BT - Selected Areas in Cryptography

A2 - Biryukov, Alex

A2 - Gong, Guang

A2 - Stinson, Douglas R.

PB - Springer

CY - Berlin; Heidelberg

T2 - 17th International Workshop on Selected Areas in Cryptography -

Y2 - 12 August 2010 through 13 August 2010

ER -

Optimal Covering Codes for Finding Near-Collisions

Abstract

Publication series

Workshop

Fields of Expertise

Access to Document

Fingerprint

Projects

FWF - kryptographische Hashfu - Cryptanalysis of modern cryptographic hash functions II

EU - ECRYPT II - European network of excellence in cryptology - Phase II

Cryptography

Cite this