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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hong, D., Sung, J., Hong, S., et al.: HIGHT: A New Block Cipher Suitable for Low-Resource Device. CHES 2006, Lecture Notes in Computer Science, vol. 4249, pp 46-59, Springer (2006)
Sasaki, Y., Wang, L.: Meet-in-the-Middle Technique for Integral Attacks against Feistel ciphers. SAC 2012, Lecture Notes in Computer Science, vol. 7707, pp. 234-251, Springer (2013)
Chen, J., Wang, M., Preneel, B.: Impossible Differential Cryptanalysis of the Lightweight Block Ciphers TEA, XTEA and HIGHT, AFRICACRYPT 2012, Lecture Notes in Computer Science, vol. 7374, pp. 117-137, Springer (2012)
Wen, L., Wang, M., Bogdanov, A., Chen, H.: Multidimensional Zero-correlation Attacks on Lightweight Block Cipher HIGHT: Improved Cryptanalysis of an ISO Standard, Information Processing Letters, vol. 114, issue 6, pp. 322-330, ELSEVIER (2014)
Özen, O., Varıcı, K., Tezcan, C., Kocair, Ç.: Lightweight Block Ciphers Revisited: Cryptanalysis of Reduced Round PRESENT and HIGHT, Information Security and Privacy, Lecture Notes in Computer Science, vol. 5594, pp. 90-107, Springer (2009)
Koo, B., Hong, D., Kwon, D.: Related-Key Attack on the Full HIGHT, ICISC 2010, Lecture Notes in Computer Science, vol. 6829, pp. 49-67, Springer (2011)
Song, J., Lee, K., Lee, H.: Biclique Cryptanalysis on Lightweight Block Cipher: HIGHT and Piccolo, International Journal of Computer Mathematics, vol. 90, issue 12, pp. 2564-2580, Taylor & Francis (2013)
Diffie, M.E., Hellman, W.: Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard. Computer, vol. 10, issue 6, pp. 74-84, IEEE (1977)
Zhu, B., Gong, G.: Multidimensional Meet-in-the-Middle Attack and Its Applications to KATAN32/48/64. Cryptology ePrint Archive: Report 2011/619.
Boztaş, Ö., Karakoç, F., Çoban, M.: Multidimensional Meet-in-the-Middle Attacks on Reduced-Round TWINE-128. Lecture Notes in Computer Science, vol. 8162, pp. 55-67, Springer (2013)
Aoki, K., Sasaki, Y.: Meet-in-the-Middle Attack against Reduced SHA-0 and SHA-1. CRYPTO 2009, Lecture Notes in Computer Science, vol. 5677, pp 70-89, Springer (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Igarashi, Y., Sueyoshi, R., Kaneko, T., Fuchida, T. (2015). Meet-in-the-middle Attack with Splice-and-Cut Technique on the 19-round Variant of Block Cipher HIGHT. In: Kim, K. (eds) Information Science and Applications. Lecture Notes in Electrical Engineering, vol 339. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-46578-3_50
Download citation
DOI: https://doi.org/10.1007/978-3-662-46578-3_50
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-46577-6
Online ISBN: 978-3-662-46578-3
eBook Packages: EngineeringEngineering (R0)