Meet-in-the-middle attack with Splice-and-Cut technique on the 19-round variant of block cipher HIGHT

Yasutaka Igarashi; Ryutaro Sueyoshi; Toshinobu Kaneko; Takayasu Fuchida

doi:10.1007/978-3-662-46578-3_50

Meet-in-the-middle attack with Splice-and-Cut technique on the 19-round variant of block cipher HIGHT

Yasutaka Igarashi, Ryutaro Sueyoshi, Toshinobu Kaneko, Takayasu Fuchida

Department of Electrical Engineering

Research output: Contribution to journal › Article › peer-review

6 Citations (Scopus)

Abstract

We show a meet-in-the-middle (MITM) attack with Splice-and-Cut technique (SCT) on the 19-round variant of the block cipher HIGHT. The original HIGHT having 32-round iteration was proposed by Hong et al. in 2006, which applies the 8-branch Type-2 generalized Feistel network (GFN) with 64- bit data block and 128-bit secret key. MITM attack was proposed by Diffie and Hellman in 1977 as a generic method to analyze symmetric-key cryptographic algorithms. SCT was proposed by Aoki and Sasaki to improve MITM attack in 2009. In this paper we show that 19-round HIGHT can be attacked with 2⁸ bytes of memory, 2⁸+2 pairs of chosen plain and cipher texts, and 2^120.7 times of the encryption operation by using MITM attack with SCT.

Original language	English
Pages (from-to)	423-429
Number of pages	7
Journal	Lecture Notes in Electrical Engineering
Volume	339
DOIs	https://doi.org/10.1007/978-3-662-46578-3_50
Publication status	Published - 2015

Keywords

Block cipher HIGHT
Meet-in-the-middle attack
Splice-and-Cut technique

Access to Document

10.1007/978-3-662-46578-3_50

Cite this

@article{5804c135468e4b60a93fd96d45ebc19f,

title = "Meet-in-the-middle attack with Splice-and-Cut technique on the 19-round variant of block cipher HIGHT",

abstract = "We show a meet-in-the-middle (MITM) attack with Splice-and-Cut technique (SCT) on the 19-round variant of the block cipher HIGHT. The original HIGHT having 32-round iteration was proposed by Hong et al. in 2006, which applies the 8-branch Type-2 generalized Feistel network (GFN) with 64- bit data block and 128-bit secret key. MITM attack was proposed by Diffie and Hellman in 1977 as a generic method to analyze symmetric-key cryptographic algorithms. SCT was proposed by Aoki and Sasaki to improve MITM attack in 2009. In this paper we show that 19-round HIGHT can be attacked with 28 bytes of memory, 28+2 pairs of chosen plain and cipher texts, and 2120.7 times of the encryption operation by using MITM attack with SCT.",

keywords = "Block cipher HIGHT, Meet-in-the-middle attack, Splice-and-Cut technique",

author = "Yasutaka Igarashi and Ryutaro Sueyoshi and Toshinobu Kaneko and Takayasu Fuchida",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2015.",

year = "2015",

doi = "10.1007/978-3-662-46578-3_50",

language = "English",

volume = "339",

pages = "423--429",

journal = "Lecture Notes in Electrical Engineering",

issn = "1876-1100",

publisher = "Springer Verlag",

}

TY - JOUR

T1 - Meet-in-the-middle attack with Splice-and-Cut technique on the 19-round variant of block cipher HIGHT

AU - Igarashi, Yasutaka

AU - Sueyoshi, Ryutaro

AU - Kaneko, Toshinobu

AU - Fuchida, Takayasu

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2015.

PY - 2015

Y1 - 2015

N2 - We show a meet-in-the-middle (MITM) attack with Splice-and-Cut technique (SCT) on the 19-round variant of the block cipher HIGHT. The original HIGHT having 32-round iteration was proposed by Hong et al. in 2006, which applies the 8-branch Type-2 generalized Feistel network (GFN) with 64- bit data block and 128-bit secret key. MITM attack was proposed by Diffie and Hellman in 1977 as a generic method to analyze symmetric-key cryptographic algorithms. SCT was proposed by Aoki and Sasaki to improve MITM attack in 2009. In this paper we show that 19-round HIGHT can be attacked with 28 bytes of memory, 28+2 pairs of chosen plain and cipher texts, and 2120.7 times of the encryption operation by using MITM attack with SCT.

AB - We show a meet-in-the-middle (MITM) attack with Splice-and-Cut technique (SCT) on the 19-round variant of the block cipher HIGHT. The original HIGHT having 32-round iteration was proposed by Hong et al. in 2006, which applies the 8-branch Type-2 generalized Feistel network (GFN) with 64- bit data block and 128-bit secret key. MITM attack was proposed by Diffie and Hellman in 1977 as a generic method to analyze symmetric-key cryptographic algorithms. SCT was proposed by Aoki and Sasaki to improve MITM attack in 2009. In this paper we show that 19-round HIGHT can be attacked with 28 bytes of memory, 28+2 pairs of chosen plain and cipher texts, and 2120.7 times of the encryption operation by using MITM attack with SCT.

KW - Block cipher HIGHT

KW - Meet-in-the-middle attack

KW - Splice-and-Cut technique

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

U2 - 10.1007/978-3-662-46578-3_50

DO - 10.1007/978-3-662-46578-3_50

M3 - Article

AN - SCOPUS:84923197852

SN - 1876-1100

VL - 339

SP - 423

EP - 429

JO - Lecture Notes in Electrical Engineering

JF - Lecture Notes in Electrical Engineering

ER -

Meet-in-the-middle attack with Splice-and-Cut technique on the 19-round variant of block cipher HIGHT

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this