Bitwise Partial-Sum on HIGHT: A New Tool for Integral Analysis Against ARX Designs
详细信息 查看全文
- 作者：Yu Sasaki (15)
Lei Wang (16) - 关键词：Integral analysis ; Partial ; sum ; Bitwise partial ; sum ; HIGHT
- 刊名：Lecture Notes in Computer Science
- 出版年：2014
- 出版时间：2014
- 年：2014
- 卷：1
- 期：1
- 页码：189-202
- 全文大小：629 KB
- 参考文献：1. Daemen, J., Knudsen, L.R., Rijmen, V.: The block cipher SQUARE. In: Biham, E. (ed.) FSE 1997. LNCS, vol. 1267, pp. 149鈥?65. Springer, Heidelberg (1997)
2. Knudsen, L.R., Wagner, D.: Integral cryptanalysis. In: Daemen, J., Rijmen, V. (eds.) FSE 2002. LNCS, vol. 2365, pp. 112鈥?27. Springer, Heidelberg (2002)
3. Biryukov, A., Shamir, A.: Structural cryptanalysis of SASAS. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 394鈥?05. Springer, Heidelberg (2001)
4. Nakahara Jr., J., de Freitas, D.S., Phan, R.C.-W.: New multiset attacks on Rijndael with large blocks. In: Dawson, E., Vaudenay, S. (eds.) Mycrypt 2005. LNCS, vol. 3715, pp. 277鈥?95. Springer, Heidelberg (2005)
5. Z鈥檃ba, M.R., Raddum, H., Henricksen, M., Dawson, E.: Bit-pattern based integral attack. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol. 5086, pp. 363鈥?81. Springer, Heidelberg (2008)
6. Lucks, S.: The saturation attack - a bait for Twofish. In: Matsui, M. (ed.) FSE 2001. LNCS, vol. 2355, pp. 1鈥?5. Springer, Heidelberg (2002)
7. Aumasson, J.P., Leurent, G., Meier, W., Mendel, F., Mouha, N., Phan, R.C.W., Sasaki, Y., Susil, P.: Tuple cryptanalysis of ARX with application to BLAKE and Skein. In: ECRYPT II Hash Workshop (2011)
8. Ferguson, N., Kelsey, J., Lucks, S., Schneier, B., Stay, M., Wagner, D., Whiting, D.L.: Improved cryptanalysis of Rijndael. In: Schneier, B. (ed.) FSE 2000. LNCS, vol. 1978, pp. 213鈥?30. Springer, Heidelberg (2001)
9. Sasaki, Y., Wang, L.: Meet-in-the-middle technique for integral attacks against feistel ciphers. In: Knudsen, L.R., Wu, H. (eds.) SAC 2012. LNCS, vol. 7707, pp. 234鈥?51. Springer, Heidelberg (2013)
10. Hong, D., et al.: HIGHT: a new block cipher suitable for low-resource device. In: Goubin, L., Matsui, M. (eds.) CHES 2006. LNCS, vol. 4249, pp. 46鈥?9. Springer, Heidelberg (2006)
11. ISO/IEC 18033鈥?:2010: Information technology-Security techniques-Encryption Algorithms-Part 3: Block ciphers (2010)
12. Chen, J., Wang, M., Preneel, B.: Impossible differential cryptanalysis of the lightweight block ciphers TEA, XTEA and HIGHT. In: Mitrokotsa, A., Vaudenay, S. (eds.) AFRICACRYPT 2012. LNCS, vol. 7374, pp. 117鈥?37. Springer, Heidelberg (2012)
13. Wu, W., Zhang, L.: LBlock: a lightweight block cipher. In: Lopez, J., Tsudik, G. (eds.) ACNS 2011. LNCS, vol. 6715, pp. 327鈥?44. Springer, Heidelberg (2011)
14. Zhang, P., Sun, B., Li, C.: Saturation attack on the block cipher HIGHT. In: Garay, J.A., Miyaji, A., Otsuka, A. (eds.) CANS 2009. LNCS, vol. 5888, pp. 76鈥?6. Springer, Heidelberg (2009)
15. Lu, J.: Cryptanalysis of block ciphers. Ph.D. thesis, Royal Holloway, University of London, England (2008)
16. 脰zen, O., Varici, K., Tezcan, C., Kocair, 脟.: Lightweight block ciphers revisited: cryptanalysis of reduced round PRESENT and HIGHT. In: Boyd, C., Gonz谩lez Nieto, J. (eds.) ACISP 2009. LNCS, vol. 5594, pp. 90鈥?07. Springer, Heidelberg (2009)
17. Koo, B., Hong, D., Kwon, D.: Related-key attack on the full HIGHT. In: Rhee, K.-H., Nyang, D.H. (eds.) ICISC 2010. LNCS, vol. 6829, pp. 49鈥?7. Springer, Heidelberg (2011)
18. Needham, R.M., Wheeler, D.J.: TEA extensions. Technical report, Computer Laboratory, University of Cambridge (1997)
19. Ferguson, N., Lucks, S., Schneier, B., Whiting, D., Bellare, M., Kohno, T., Callas, J., Walker, J.: The Skein hash function family. Submission to NIST (Round 2) (2009)
20. Korea Internet and Security Agency: HIGHT Algorithm Specification (2009) - 作者单位：Yu Sasaki (15)
Lei Wang (16)
15. NTT Secure Platform Laboratories, Tokyo, Japan
16. Nanyang Technological University, Singapore, Singapore - ISSN：1611-3349
文摘
In this paper, we present a new cryptanalytic tool that can reduce the complexity of integral analysis against Addition-Rotation-XOR (ARX) based designs. Our technique is based on the partial-sum technique proposed by Ferguson et al. at FSE 2000, which guesses subkeys byte to byte in turn, and the data to be analyzed is compressed for each key guess. In this paper, the technique is extended to ARX based designs. Subkeys are guessed in bitwise, and the data is compressed with respect to the sum of the guessed bit position and carry values to the next bit position. We call the technique bitwise partial-sum. We demonstrate this technique by applying it to reduced-round HIGHT, which is one of the ISO standard ciphers. Another contribution is an independent improvement specific to HIGHT which exploits more linearity inside the round function. Together with the bitwise partial-sum, the integral analysis on HIGHT is extended from previous 22 rounds to 26 rounds.