Abstract
With the rapid evolvement of cryptanalysis, attacks with multiple distinguishers have emerged gradually. Many new cryptanalytic methods such as multiple differential cryptanalysis, multiple linear cryptanalysis, multiple impossible differential cryptanalysis, multidimensional zero correlation linear cryptanalysis have been proposed, which have greatly enhanced the efficiency of corresponding attacks. During these attacks, discovering more distinguishers has always been a trivial and manual work. Many cryptographers use their expertise and experience to achieve this goal. However, in most cases, either the length of the attack or the number of distinguishers is underestimated. This paper proposes a generic method to discover more different distinguishers based on a new property called “weak rotational property”. Block ciphers with this property can easily discover more distinguishers such as truncated differential distinguishers, impossible differential distinguishers and zero correlation linear distinguishers in a theoretical approach. Then the number of equivalent distinguishers is proved in a mathematical form. As an application, this paper focuses on SIMON family ciphers to illustrate how this property improves cryptanalysis. For the section of application, first of all, SIMON family ciphers are proved to have weak rotational property. Thus the number of corresponding discovered distinguishers can be increased for SIMON. Then, some earlier observations on SIMON are extended accordingly to this new property. Finally, based on the idea of weak rotational property and equivalent-subkey technique, an improved impossible differential cryptanalysis on SIMON is proposed. For SIMON32(64)/SIMON128(128)/SIMON128(192), the rounds attacked are all extended by one round. For other variants of SIMON, current best non full codebook impossible differential attacks are derived. The successful application of weak rotational property indicates its potential in cryptanalysis.















Similar content being viewed by others
References
Abed F., List E., Lucks S., Wenzel J.: Differential and linear cryptanalysis of reduced-round simon. Cryptology ePrint Archive, Report 2013/526 (2013)
Alizadeh J., AlKhzaimi H., Aref M.R., Bagheri N., Gauravaram P., Kumar A., Lauridsen M.M., Sanadhya S.K.: Cryptanalysis of SIMON variants with connections. In: Saxena N., Sadeghi, A. (eds.) Radio frequency identification: security and privacy issues—10th International Workshop, RFIDSec 2014, Oxford, UK, July 21–23, 2014, Revised Selected Papers, Lecture Notes in Computer Science, vol. 8651, pp. 90–107. Springer (2014)
AlKhzaimi H., Lauridsen M.M.: Cryptanalysis of the SIMON family of block ciphers. IACR Cryptol. 2013, 543 (2013).
Aumasson J.P., Leurent G., Meier W., Mendel F., Mouha N., Phan R.C., Sasaki Y., Susil P.: Tuple cryptanalysis of arx with application to blake and skein. In: ECRYPT II Hash Workshop, Date: 2011/05/19–2011/05/20, Location: Tallinn, Estonia, pp. 1–13 (2011)
Beaulieu R., Shors D., Smith J., Treatman-Clark S., Weeks B., Wingers L.: The SIMON and SPECK families of lightweight block ciphers. IACR Cryptol. 2013, 404 (2013).
Biham E., Biryukov A., Shamir A.: Miss in the middle attacks on IDEA and khufu. In: Knudsen L.R. (ed.) Fast Software Encryption, 6th International Workshop, FSE 99, Rome, Italy, March 24–26, 1999, Proceedings, Lecture Notes in Computer Science, vol. 1636, pp. 124–138. Springer (1999)
Biryukov A., Cannire C.D., Quisquater M.: On multiple linear approximations. In: Franklin M.K. (ed.) Advances in Cryptology—CRYPTO 2004, 24th Annual International CryptologyConference, Santa Barbara, California, USA, August 15–19, 2004, Proceedings, Lecture Notes in Computer Science, vol. 3152, pp. 1–22. Springer (2004)
Blondeau C., Grard B.: Multiple differential cryptanalysis: Theory and practice. In: Joux A. (ed.) Fast Software Encryption—18th International Workshop, FSE 2011, Lyngby, Denmark, February 13–16, 2011, Revised Selected Papers, Lecture Notes in Computer Science, vol. 6733, pp. 35–54. Springer (2011)
Bogdanov A., Wang M.: Zero correlation linear cryptanalysis with reduced data complexity. In: Canteaut A. (ed.) Fast Software Encryption—19th International Workshop, FSE 2012, Washington, DC, USA, March 19–21, 2012. Revised Selected Papers, Lecture Notes in Computer Science, vol. 7549, pp. 29–48. Springer (2012)
Bogdanov A., Leander G., Nyberg K., Wang M.: Integral and multidimensional linear distinguishers with correlation zero. In: Wang X., Sako K. (eds.) Advances in Cryptology - ASIACRYPT 2012—18th international conference on the theory and application of cryptology and information security, Beijing, China, December 2–6, 2012. Proceedings, Lecture Notes in Computer Science, vol. 7658, pp. 244–261. Springer (2012)
Boura C., Naya-Plasencia M., Suder V.: Scrutinizing and improving impossible differential attacks: Applications to clefia, camellia, lblock and simon. In: Sarkar P., Iwata T. (eds.) Advances in Cryptology-ASIACRYPT 2014—20th International conference on the theory and application of cryptology and information security, Kaoshiung, Taiwan, R.O.C., December 7–11, 2014. Proceedings, Part I, Lecture Notes in Computer Science, vol. 8873, pp. 179–199. Springer (2014)
Chen Z., Wang N., Wang X.: Impossible differential cryptanalysis of reduced round SIMON. IACR Cryptol. 2015, 286 (2015).
Ferguson N., Lucks S., Schneier B., Whiting D., Bellare M., Kohno T., Callas J., Walker J.: The Skein hash function family. Submitted to SHA-3 Competition (2008)
Isobe T., Shibutani K.: Generic key recovery attack on feistel scheme. In: Sako K., Sarkar P. (eds.) Advances in Cryptology-ASIACRYPT 2013—19th International Conference on the Theory and Application of Cryptology and Information Security, Bengaluru, India, December 1–5, 2013, Proceedings, Part I, Lecture Notes in Computer Science, vol. 8269, pp. 464–485. Springer (2013)
Khovratovich D., Nikolic I.: Rotational cryptanalysis of ARX. In: Hong S., Iwata T. (eds.) Fast software encryption, 17th international workshop, FSE 2010, Seoul, Korea, February 7–10, 2010, revised selected papers, lecture notes in computer science, vol. 6147, pp. 333–346. Springer (2010)
Kim J., Hong S., Sung J., Lee C., Lee S.: Impossible differential cryptanalysis for block cipher structures. In: Johansson T., Maitra S. (eds.) Progress in Cryptology-INDOCRYPT 2003, 4th international conference on cryptology in India, New Delhi, India, December 8–10, 2003, Proceedings, Lecture Notes in Computer Science, vol. 2904, pp. 82–96. Springer (2003)
Lu J., Kim J., Keller N., Dunkelman O.: Improving the efficiency of impossible differential cryptanalysis of reduced Camellia and MISTY1. In CT-RSA, vol. 4964 of LNCS, pp. 370–386. Springer (2008)
Luo Y., Lai X., Wu Z., Gong G.: A unified method for finding impossible differentials of block cipher structures. Inf. Sci. 263, 211–220 (2014).
Soleimany H., Nyberg K.: Zero-correlation linear cryptanalysis of reduced-round lblock. Des. Codes Cryptogr. 73(2), 683–698 (2014).
Sun L., Fu K., Wang M.: Improved zero-correlation cryptanalysis on SIMON. In: Lin D., Wang X., Yung M. (eds.) Information security and cryptology—11th international conference, Inscrypt 2015, Beijing, China, November 1–3, 2015, Revised Selected Papers, Lecture Notes in Computer Science, vol. 9589, pp. 125–143. Springer (2015)
Tsunoo Y., Tsujihara E., Shigeri M., Suzaki T., Kawabata T.: Cryptanalysis of clefia using multiple impossible differentials. pp. 1–6 (2009)
Wang Q., Liu Z., Varici K., Sasaki Y., Rijmen V., Todo Y.: Cryptanalysis of reduced-round SIMON32 and SIMON48. In: Meier W., Mukhopadhyay D. (eds.) Progress in Cryptology-INDOCRYPT 2014—15th international conference on cryptology in India, New Delhi, India, December 14–17, 2014, Proceedings, Lecture Notes in Computer Science, vol. 8885, pp. 143–160. Springer (2014)
Zhang K., Guan J., Hu B.: Automatic search of impossible differentials and zero-correlation linear hulls for ARX ciphers. China Commun. 15(2), 54–66 (2018).
Zhang K., Guan J., Hu B., Lin D.: Security evaluation on Simeck against zero-correlation linear cryptanalysis. IET Inf. Secur. 12(1), 87–93 (2018).
Acknowledgements
This work was partially supported by the National Natural Science Foundation of China under Grant Nos. 61802437, 61972248, 61902428, 62102448 and China Postdoctoral Science Foundation under Grant No. 2020M681314.
Author information
Authors and Affiliations
Corresponding authors
Additional information
Communicated by T. Iwata.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Zhang, K., Lai, X., Guan, J. et al. Weak rotational property and its application. Des. Codes Cryptogr. 91, 3187–3214 (2023). https://doi.org/10.1007/s10623-023-01241-5
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-023-01241-5