微信服务号

微信订阅号

2025-4-3- 19
Home > Archive>Volume 30, Issue 8, 2019 >2337-2348. DOI:10.13328/j.cnki.jos.005759
PDF HTML XML Export Cite reminder
Truncated Impossible Differential Cryptanalysis of Midori-64
Author:
Affiliation:

Clc Number:

TP309

Fund Project:

Open Foundation of Science and Technology on Information Assurance Laboratory (KJ-17-003)

  • Article
    • | |
  • Metrics
    • |
  • Reference [20]
    • |
  • Related
    • | | |
  • Comments
    Abstract:

    The security of Midori-64 under truncated impossible differential cryptanalysis was studied. Firstly, by analyzing the differential paths of Midori in encryption and decryption direction, it was proved that the upper bound for the rounds of impossible differential distinguishers in single-key setting for Midori is 6. And the 6-round truncated impossible differential distinguisher was classified. Secondly, based on the classification, a 6-round distinguisher was constructed. At the same time the impossible differential attack on 11-round Midori-64 was given to recover the 128-bit master key with a time complexity of 2121.4 11-round encryptions, a data complexity of 260.8 chosen-plaintexts, and a memory complexity of 296.5 64-bit blocks.

    Reference
    [1] Knudsen L. DEAL-A 128-bit block cipher. Technical Report, No.151, Department of Informatics, University of Bergen, 1998.
    [2] Biham E, Biryukov A, Shamir A. Cryptanalysis of skipjack reduced to 31 rounds using impossible differentials. In:Proc. of the EUROCRYPT'99. Berlin, Heidelberg:Springer-Verlag, 1999. 12-23.
    [3] Kim J, Hong S, Lim J. Impossible differential cryptanalysis using matrix method. Discrete Mathematics, 2010,310(5):988-1002.
    [4] Luo YY, Lai XJ, Wu ZM, Gong G. A unified method for finding impossible differentials of block cipher structures. Information Sciences, 2014,263(1):211-220.
    [5] Sun B, Liu M, Guo J, Rijmen V, Li RL. Provable security evaluation of structures against impossible differential and zero correlation linear cryptanalysis. In:Proc. of the Advances in Cryptology (EUROCRYPT 2016). Berlin, Heidelberg:Springer-Verlag, 2016. 196-213.
    [6] Bogdanov A, Knudsen LR, Leander G, Paar C, Poschmann A, Robshaw MJB, Seurin Y, Vikkelsoe C. PRESENT:An ultra-lightweight block cipher. In:Proc. of the CHES 2007. Berlin, Heidelberg:Springer-Verlag, 2007. 450-466.
    [7] Izadi M, Sadeghiyan B, Sadeghian SS, Khanook HA. MIBS:A new lightweight block cipher. In:Proc. of the CANS 2009. Berlin, Heidelberg:Springer-Verlag, 2009. 334-348.
    [8] Dolmatov V. GOST 28147-89 encryption, decryption and MAC algorithms. RFC 5830, IETF, 2010. http://tools.ietf.org/html/rfc5830
    [9] Gong Z, Nikova S, Law YW. KLEIN:A new family of lightweight block ciphers. In:Proc. of the Int'l Workshop on Radio Frequency Identification:Security and Privacy Issues. Berlin, Heidelberg:Springer-Verlag, 2011. 1-18.
    [10] Guo J, Peyrin T, Poschmann A, Robshaw M. The LED block cipher. In:Proc. of the CHES 2011. Berlin, Heidelberg:Springer-Verlag, 2011. 326-341.
    [11] Shibutani K, Isobe T, Hiwatari H, Mitsuda A, Akishita T, Shirai T. Piccolo:An ultra-lightweight block cipher. In:Proc. of the CHES 2011. Berlin, Heidelberg:Springer-Verlag, 2011. 342-357.
    [12] Wu WL, Zhang L. LBlock:A lightweight block cipher. In:Proc. of the Int'l Conf. on Applied Cryptography and Network Security. Berlin, Heidelberg:Springer-Verlag, 2011. 327-344.
    [13] Borghoff J, Canteaut A, Güneysu T, Kavun EB, Knezevic M, Knudsen LR, Leander G, Nikov V, Paar C, Rechberger C, Rombouts P, Thomsen SS, Yalçin T. PRINCE-A low-latency block cipher for pervasive computing applications. In:Proc. of the Int'l Conf. on the Theory and Application of Cryptology and Information Security. Berlin, Heidelberg:Springer-Verlag, 2012. 208-225.
    [14] Banik S, Bogdanov A, Isobe T, Shibutani K, Hiwatari H, Akishita T, Regazzoni F. Midori:A block cipher for low energy. In:Proc. of the ASIACRYPT 2015. Berlin, Heidelberg:Springer-Verlag, 2015. 411-436.
    [15] Lin L, Wu WL. Meet-in-the-Middle attacks on reduced-round Midori64. IACR Trans. on Symmetric Cryptology, 2017,2017(1):215-239.
    [16] Guo J, Jean J, Nikolić I, Qiao K, Sasaki Y, Sim SM. Invariant subspace attack against full midori64. In:Proc. of the IACR Cryptology ePrint Archive. 2015. https://eprint.iacr.org/2015/1189.pdf
    [17] Chen Z, Wang XY. Impossible differential cryptanalysis of Midori. In:Proc. of the Int'l Conf. on Mechatronics and Automation, World Scientific. 2017. 221-229.[doi:10.1142/9789813208537_0028]
    [18] Cui JY. Research on cryptanalysis based on meet-in-the-middle[MS. Thesis]. Zhengzhou:Information Engineering University, 2017(in Chinese with English abstract).
    附中文参考文献:
    [18] 崔竞一.基于中间相遇思想的攻击方法研究[硕士学位论文].郑州:信息工程大学,2017.
    Related
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

李明明,郭建胜,崔竞一,徐林宏. Midori-64算法的截断不可能差分分析.软件学报,2019,30(8):2337-2348

Copy
Share
Article Metrics
  • Abstract:3371
  • PDF: 5510
  • HTML: 3352
  • Cited by: 0
History
  • Received:April 24,2018
  • Revised:September 21,2018
  • Online: April 03,2019
Links:Institute of Software, CASChina Computer FederationCASNSFC
You are the first2032434Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063