Efficient Construction of the Kite Generator Revisited

Orr Dunkelman; Ariel Weizman

doi:10.1007/978-3-319-94147-9_2

Efficient Construction of the Kite Generator Revisited

Orr Dunkelman, Ariel Weizman

Department of Computer Science

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

Abstract

The kite generator, first introduced by Andreeva et al.[1], is a strongly connected directed graph that allows creating a message of almost any desired length, connecting two chaining values covered by the kite generator. The kite generator can be used in second pre-image attacks against (dithered) Merkle-Damgård hash functions. In this work we discuss the complexity of constructing the kite generator. We show that the analysis of the construction of the kite generator first described by Andreeva et al.is somewhat inaccurate and discuss its actual complexity. We follow with presenting a new method for a more efficient construction of the kite generator, cutting the running time of the preprocessing by half (compared with the original claims of Andreeva et al. or by a linear factor compared to corrected analysis). Finally, we adapt the new method to the dithered Merkle-Damgård structure.

Original language	English
Title of host publication	Cyber Security Cryptography and Machine Learning - Second International Symposium, CSCML 2018, Proceedings
Editors	Itai Dinur, Shlomi Dolev, Sachin Lodha
Publisher	Springer Verlag
Pages	6-19
Number of pages	14
ISBN (Print)	9783319941462
DOIs	https://doi.org/10.1007/978-3-319-94147-9_2
State	Published - 2018
Event	2nd International Symposium on Cyber Security Cryptography and Machine Learning, CSCML 2018 - Beer-Sheva, Israel Duration: 21 Jun 2018 → 22 Jun 2018

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	10879 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	2nd International Symposium on Cyber Security Cryptography and Machine Learning, CSCML 2018
Country/Territory	Israel
City	Beer-Sheva
Period	21/06/18 → 22/06/18

Bibliographical note

Publisher Copyright:
© 2018, Springer International Publishing AG, part of Springer Nature.

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-319-94147-9_2

Cite this

Dunkelman, O., & Weizman, A. (2018). Efficient Construction of the Kite Generator Revisited. In I. Dinur, S. Dolev, & S. Lodha (Eds.), Cyber Security Cryptography and Machine Learning - Second International Symposium, CSCML 2018, Proceedings (pp. 6-19). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10879 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-94147-9_2

Dunkelman, Orr ; Weizman, Ariel. / Efficient Construction of the Kite Generator Revisited. Cyber Security Cryptography and Machine Learning - Second International Symposium, CSCML 2018, Proceedings. editor / Itai Dinur ; Shlomi Dolev ; Sachin Lodha. Springer Verlag, 2018. pp. 6-19 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{fff621b3bc6042d499685e9d4be1409b,

title = "Efficient Construction of the Kite Generator Revisited",

abstract = "The kite generator, first introduced by Andreeva et al.[1], is a strongly connected directed graph that allows creating a message of almost any desired length, connecting two chaining values covered by the kite generator. The kite generator can be used in second pre-image attacks against (dithered) Merkle-Damg{\aa}rd hash functions. In this work we discuss the complexity of constructing the kite generator. We show that the analysis of the construction of the kite generator first described by Andreeva et al.is somewhat inaccurate and discuss its actual complexity. We follow with presenting a new method for a more efficient construction of the kite generator, cutting the running time of the preprocessing by half (compared with the original claims of Andreeva et al. or by a linear factor compared to corrected analysis). Finally, we adapt the new method to the dithered Merkle-Damg{\aa}rd structure.",

author = "Orr Dunkelman and Ariel Weizman",

note = "Publisher Copyright: {\textcopyright} 2018, Springer International Publishing AG, part of Springer Nature.; 2nd International Symposium on Cyber Security Cryptography and Machine Learning, CSCML 2018 ; Conference date: 21-06-2018 Through 22-06-2018",

year = "2018",

doi = "10.1007/978-3-319-94147-9_2",

language = "English",

isbn = "9783319941462",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "6--19",

editor = "Itai Dinur and Shlomi Dolev and Sachin Lodha",

booktitle = "Cyber Security Cryptography and Machine Learning - Second International Symposium, CSCML 2018, Proceedings",

address = "Germany",

}

Dunkelman, O & Weizman, A 2018, Efficient Construction of the Kite Generator Revisited. in I Dinur, S Dolev & S Lodha (eds), Cyber Security Cryptography and Machine Learning - Second International Symposium, CSCML 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10879 LNCS, Springer Verlag, pp. 6-19, 2nd International Symposium on Cyber Security Cryptography and Machine Learning, CSCML 2018, Beer-Sheva, Israel, 21/06/18. https://doi.org/10.1007/978-3-319-94147-9_2

Efficient Construction of the Kite Generator Revisited. / Dunkelman, Orr; Weizman, Ariel.
Cyber Security Cryptography and Machine Learning - Second International Symposium, CSCML 2018, Proceedings. ed. / Itai Dinur; Shlomi Dolev; Sachin Lodha. Springer Verlag, 2018. p. 6-19 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10879 LNCS).

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

TY - GEN

T1 - Efficient Construction of the Kite Generator Revisited

AU - Dunkelman, Orr

AU - Weizman, Ariel

PY - 2018

Y1 - 2018

N2 - The kite generator, first introduced by Andreeva et al.[1], is a strongly connected directed graph that allows creating a message of almost any desired length, connecting two chaining values covered by the kite generator. The kite generator can be used in second pre-image attacks against (dithered) Merkle-Damgård hash functions. In this work we discuss the complexity of constructing the kite generator. We show that the analysis of the construction of the kite generator first described by Andreeva et al.is somewhat inaccurate and discuss its actual complexity. We follow with presenting a new method for a more efficient construction of the kite generator, cutting the running time of the preprocessing by half (compared with the original claims of Andreeva et al. or by a linear factor compared to corrected analysis). Finally, we adapt the new method to the dithered Merkle-Damgård structure.

AB - The kite generator, first introduced by Andreeva et al.[1], is a strongly connected directed graph that allows creating a message of almost any desired length, connecting two chaining values covered by the kite generator. The kite generator can be used in second pre-image attacks against (dithered) Merkle-Damgård hash functions. In this work we discuss the complexity of constructing the kite generator. We show that the analysis of the construction of the kite generator first described by Andreeva et al.is somewhat inaccurate and discuss its actual complexity. We follow with presenting a new method for a more efficient construction of the kite generator, cutting the running time of the preprocessing by half (compared with the original claims of Andreeva et al. or by a linear factor compared to corrected analysis). Finally, we adapt the new method to the dithered Merkle-Damgård structure.

UR - http://www.scopus.com/inward/record.url?scp=85049042000&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-94147-9_2

DO - 10.1007/978-3-319-94147-9_2

M3 - Conference contribution

AN - SCOPUS:85049042000

SN - 9783319941462

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 6

EP - 19

BT - Cyber Security Cryptography and Machine Learning - Second International Symposium, CSCML 2018, Proceedings

A2 - Dinur, Itai

A2 - Dolev, Shlomi

A2 - Lodha, Sachin

PB - Springer Verlag

T2 - 2nd International Symposium on Cyber Security Cryptography and Machine Learning, CSCML 2018

Y2 - 21 June 2018 through 22 June 2018

ER -

Dunkelman O, Weizman A. Efficient Construction of the Kite Generator Revisited. In Dinur I, Dolev S, Lodha S, editors, Cyber Security Cryptography and Machine Learning - Second International Symposium, CSCML 2018, Proceedings. Springer Verlag. 2018. p. 6-19. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-94147-9_2

Efficient Construction of the Kite Generator Revisited

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this