Processing math: 100%
We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Advanced Search
Volume 30 Issue 6
November  2015
Turn off MathJax
Article Contents
Abstract
References
Related Articles
Xiao-Li Yu, Wen-Ling Wu, Zhen-Qing Shi, Jian Zhang, Lei Zhang, Yan-Feng Wang. Zero-Correlation Linear Cryptanalysis of Reduced-Round SIMON[J]. Journal of Computer Science and Technology, 2015, 30(6): 1358-1369. DOI: 10.1007/s11390-015-1603-5
Citation: Xiao-Li Yu, Wen-Ling Wu, Zhen-Qing Shi, Jian Zhang, Lei Zhang, Yan-Feng Wang. Zero-Correlation Linear Cryptanalysis of Reduced-Round SIMON[J]. Journal of Computer Science and Technology, 2015, 30(6): 1358-1369. DOI: 10.1007/s11390-015-1603-5
shu

Zero-Correlation Linear Cryptanalysis of Reduced-Round SIMON

  • 1 Trusted Computing and Information Assurance Laboratory, Institute of Software, Chinese Academy of Sciences Beijing 100190, China;
    2 University of Chinese Academy of Sciences, Beijing 100049, China

Funds: This work was supported by the National Basic Research 973 Program of China under Grant No. 2013CB338002 and the National Natural Science Foundation of China under Grant Nos. 61272476, 61202420, and 61232009.
More Information
  • Author Bio:

    Xiao-Li Yu received her Ph.D. degree in information security from Institute of Software (IOS), Chinese Academy of Sciences (CAS), Beijing, 2015. Her research interests include design and cryptanalysis of block ciphers.

  • Received Date: March 17, 2014
  • Revised Date: June 01, 2015
  • Published Date: November 04, 2015
    Abstract
  • In June 2013, the U.S. National Security Agency proposed two families of lightweight block ciphers, called SIMON and SPECK respectively. These ciphers are designed to perform excellently on both hardware and software platforms. In this paper, we mainly present zero-correlation linear cryptanalysis on various versions of SIMON. Firstly, by using missin- the-middle approach, we construct zero-correlation linear distinguishers of SIMON, and zero-correlation linear attacks are presented based on careful analysis of key recovery phase. Secondly, multidimensional zero-correlation linear attacks are used to reduce the data complexity. Our zero-correlation linear attacks perform better than impossible differential attacks proposed by Abed et al. in ePrint Report 2013/568. Finally, we also use the divide-and-conquer technique to improve the results of linear cryptanalysis proposed by Javad et al. in ePrint Report 2013/663.
    • FullText(HTML)
    • References (22)
  • [1]
    Bogdanov A, Knudsen L, Leander G et al. PRESENT: An ultra-lightweight block cipher. In Proc. the 9th International Workshop on Cryptographic Hardware and Embedded Systems, September 2007, pp.450-466.
    [2]
    Wu W, Zhang L. LBlock: A lightweight block cipher. In Proc. the 9th International Conference on Applied Cryptography and Network Security, June 2011, pp.327-344.
    [3]
    Gong Z, Nikova S, Law Y. KLEIN: A new family of lightweight block ciphers. In Proc. the 7th International Workshop on RFID Security and Privacy (RFIDSec), June 2011, pp.1-18.
    [4]
    Shibutani K, Isobe T, Hiwatari H et al. Piccolo: An ultralightweight blockcipher. In Proc. the 13th International Workshop on Cryptographic Hardware and Embedded Systems, September 28-October 1, 2011, pp.342-357.
    [5]
    Guo J, Peyrin T, Poschmann A et al. The LED block cipher. In Proc. the 13th International Workshop on Cryptographic Hardware and Embedded Systems, September 28-October 1, 2011, pp.326-341.
    [6]
    Borghoff J, Canteaut A, Güneysu T et al. PRINCE — A low-latency block cipher for pervasive computing applications. In Proc. the 18th International Conference on the Theory and Application of Cryptology and Information Security, December 2012, pp.208-225.
    [7]
    Beaulieu R, Shors D, Smith J et al. The SIMON and SPECK families of lightweight block ciphers. Cryptology ePrint Archive: Report 404, 2013. http://eprint.iacr.org/2013/404, April 2015.
    [8]
    Abed F, List E, Lucks S et al. Differential and linear cryptanalysis of reduced-round SIMON. Cryptology ePrint Archive: Report 526, 2013. http://eprint.iacr.org/2013/526.pdf, April 2015.
    [9]
    Alkhzaimi H, Lauridsen M. Cryptanalysis of the SIMON family of block ciphers. Cryptology ePrint Archive: Report 543, 2013. http://eprint.iacr.org/2013/543.pdf, April 2015.
    [10]
    Abed F, List E, Lucks S et al. Cryptanalysis of the SPECK family of block ciphers. Cryptology ePrint Archive: Report 568, 2013. http://eprint.iacr.org/2013/568, April 2015.
    [11]
    Alizadeh J, Bagheri N, Gauravaram P et al. Linear cryptanalysis of round reduced variants of SIMON. Cryptology ePrint Archive: Report 663, 2013. http://eprint.iacr.org/2013/663.pdf, April 2015.
    [12]
    Abed F, List E, Lucks S et al. Differential cryptanalysis of reduced-round SIMON and SPECK. In Proc. the 21st International Workshop on Fast Software Encryption, March 2014, pp.525-545.
    [13]
    Biryukov A, Roy A, Velichkov V. Differential analysis of block ciphers SIMON and SPECK. In Proc. the 21st International Workshop on Fast Software Encryption, March 2014, pp.546-570.
    [14]
    Wang Q, Liu Z, Var?c? K et al. Cryptanalysis of reducedround SIMON32 and SIMON48. Cryptology ePrint Archive: Report 761, 2014. http://eprint.iacr.org/2014/761.pdf, April 2015.
    [15]
    Bogdanov A, Rijmen V. Linear hulls with correlation zero and linear cryptanalysis of block ciphers. Cryptology ePrint Archive, Report 123, 2011. http://eprint.iacr.org/2011/123, Mar. 2011.
    [16]
    Bogdanov A, Wang M. Zero correlation linear cryptanalysis with reduced data complexity. In Proc. the 19th International Workshop on Fast Software Encryption, March 2012, pp.29-48.
    [17]
    Bogdanov A, Leander G, Nyberg K et al. Integral and multidimensional linear distinguishers with correlation zero. In Proc. the 18th International Conference on the Theory and Application of Cryptology and Information Security, December 2012, pp.244-261.
    [18]
    Soleimany H, Nyberg K. Zero-correlation linear cryptanalysis of reduced-round LBlock. Designs, Codes and Cryptography, 2014, 73(2): 683-698.
    [19]
    Biham E. On Matsui's linear cryptanalysis. In Proc. the Workshop on the Theory and Application of Cryptographic Techniques, May 1994, pp.341-355.
    [20]
    Matsui M. Linear cryptoanalysis method for DES cipher. In Proc. the Workshop on the Theory and Application of Cryptographic Techniques, May 1993, pp.386-397.
    [21]
    Bogdanov A, Rijmen V. Linear hulls with correlation zero and linear cryptanalysis of block ciphers. Designs, Codes and Cryptography, 2014, 70(3): 369-383.
    [22]
    Harpes C, Kramer G G, Massey J L. A generalization of linear cryptanalysis and the applicability of Matsui's piling-up lemma. In Proc. the 14th Advances in Cryptology- Eurocrypt, May 1995, pp.24-38.
    • Relative Articles

  • Related Articles

    [1]Yu-Chu Fang, Wen-Zhong Li, Yao Zeng, Qing-Ning Lu, Sang-Lu Lu. Pushing to the Limit: An Attention-Based Dual-Prune Approach for Highly-Compacted CNN Filter Pruning[J]. Journal of Computer Science and Technology, 2025, 40(3): 805-820. DOI: 10.1007/s11390-024-3536-3
    [2]Ying Liu, Hong-Ying Liu, Ke Xu, Meng Shen. A Family of Stable Multipath Dual Congestion Control Algorithms[J]. Journal of Computer Science and Technology, 2015, 30(6): 1274-1289. DOI: 10.1007/s11390-015-1598-y
    [3]Jing-Yuan Zhao, Mei-Qin Wang, Long Wen. Improved Linear Cryptanalysis of CAST-256[J]. Journal of Computer Science and Technology, 2014, 29(6): 1134-1139. DOI: 10.1007/s11390-014-1496-8
    [4]Ming-Jie Liu, Jia-Zhe Chen. Improved Linear Attacks on the Chinese Block Cipher Standard[J]. Journal of Computer Science and Technology, 2014, 29(6): 1123-1133. DOI: 10.1007/s11390-014-1495-9
    [5]Rui Xue, Ning-Hui Li, Jiang-Tao Li. Algebraic Construction for Zero-Knowledge Sets[J]. Journal of Computer Science and Technology, 2008, 23(2): 166-175.
    [6]Yi-Song Wang, Ming-Yi Zhang, Yu-Ping Shen. Consistency Property of Finite FC-Normal Logic Programs[J]. Journal of Computer Science and Technology, 2007, 22(4): 554-561.
    [7]Chiou-Yng Lee, Jenn-Shyong Horng, I-Chang Jou. Low-Complexity Bit-Parallel Multiplier over GF(2m) Using Dual Basis Representation[J]. Journal of Computer Science and Technology, 2006, 21(6): 887-892.
    [8]ZHAO Jianhua. Checking Timed Automata for Linear Duration Properties[J]. Journal of Computer Science and Technology, 2000, 15(5): 423-429.
    [9]ZHAO Jianhua, Dang Van Hung. Checking Timed Automata for Linear Duration Properties[J]. Journal of Computer Science and Technology, 2000, 15(5).
    [10]Zhang Xubo. Some Results on the Confluence Property of Combined Term Rewriting Systems[J]. Journal of Computer Science and Technology, 1991, 6(3): 291-295.
    • Supplements (0)

Catalog

    Get Citation
    PDF
    XML
    Article views (29) PDF downloads (1300) Cited by()
    Related

    Copyright ©2025 JCST, All Rights Reserved     京ICP备05002829号-1

    Institute of Computing Technology, Chinese Academy of Sciences
    P.O. Box 2704, Beijing 100190, P.R. China

    Tel.: 86-10-62610746 E-mail: jcst@ict.ac.cn

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return