改进的Joltik-BC-128算法的中间相遇攻击

李征; 任炯炯; 李曼曼; 陈少真

doi:10.11959/j.issn.2096-109x.2024073

您当前的位置：

首页 >

文章列表页 >

改进的Joltik-BC-128算法的中间相遇攻击

学术论文 | 更新时间：2024-12-20

- 改进的Joltik-BC-128算法的中间相遇攻击
- Improved meet-in-the-middle attack on Joltik-BC-128
- 网络与信息安全学报 2024年10卷第5期页码：145-151
- 作者机构：
  
  信息工程大学，河南郑州 450001
- 作者简介：
  
  [ "李征（1994-），男，辽宁沈阳人，信息工程大学硕士生，主要研究方向为分组密码的设计与分析。" ]
  [ "任炯炯（1995-），男，甘肃天水人，信息工程大学讲师，主要研究方向为分组密码的安全性分析。" ]
  [ "李曼曼（1986-），女，河南开封人，信息工程大学讲师，主要研究方向为网络空间安全、对称密码的设计与分析。" ]
  [ "陈少真（1967-），女，江苏无锡人，信息工程大学教授、博士生导师，主要研究方向为密码学与信息安全。" ]
- 基金信息：
  
  国家自然科学基金(62206312)
- DOI：10.11959/j.issn.2096-109x.2024073
  中图分类号： TN918.1
- 收稿：2024-01-16，
  
  修回：2024-07-30，
  
  纸质出版：2024-10-25
- 稿件说明：
移动端阅览
李征, 任炯炯, 李曼曼, 等. 改进的Joltik-BC-128算法的中间相遇攻击[J]. 网络与信息安全学报, 2024, 10(5): 145-151.

Format: LI Z, REN J J, LI M M, et al. Improved meet-in-the-middle attack on Joltik-BC-128[J]. Chinese Journal of Network and Information Security, 2024, 10(5): 145-151.
李征, 任炯炯, 李曼曼, 等. 改进的Joltik-BC-128算法的中间相遇攻击[J]. 网络与信息安全学报, 2024, 10(5): 145-151. DOI： 10.11959/j.issn.2096-109x.2024073.

Format: LI Z, REN J J, LI M M, et al. Improved meet-in-the-middle attack on Joltik-BC-128[J]. Chinese Journal of Network and Information Security, 2024, 10(5): 145-151. DOI： 10.11959/j.issn.2096-109x.2024073.

摘要

Joltik-BC是在2014年亚密会上发布的一种轻量级可调分组密码算法，该算法采用替换-置换网络（SPN，substitution-permutation network）结构和Tweakey框架。通过研究Joltik-BC算法的内部特征，利用控制调柄差分方法，并结合差分枚举技术和S盒的差分特性，构造了6轮Joltik -BC-128算法的中间相遇区分器。利用此区分器改进了9轮Joltik-BC-128算法的中间相遇攻击结果。改进后的9轮Joltik-BC-128算法的中间相遇攻击的存储复杂度为

https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=69625904&type=

2.45533323

https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=69625902&type=

6.26533365

个长度为64的比特块，时间复杂度为

https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=69625907&type=

2.45533323

https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=69625922&type=

3.72533321

次9轮Joltik-BC-128加密。相比已有中间相遇攻击结果，该算法的时间复杂度和存储复杂度均显著降低。

Abstract

The Joltik-BC

adopting the substitution-permutation network structure and Tweakey framework

was a lightweight tweakable block cipher published at ASIACRPYPT 2014. By researching the internal characteristic of the Joltik-BC

a 6-round meet-in-the-middle distinguisher against the Joltik-BC-128 was constructed by controlling the tweakey differentials and combining differential enumeration and differential characteristics of S-boxes. An improved meet-in-the-middle attack against the 9-round Joltik-BC-128 was developed using this distinguisher. The memory and time complexities of the improved 9-round Joltik-BC-128 were 244.91 64-bits blocks and 248 9-round Joltik-BC-128 encryptions. Compared with existing meet-in-the-middle attack results

the time complexity and memory complexity of this method were significantly reduced.

关键词

Keywords

references

JEAN J , NIKOLIC I , PEYRIN T . Tweaks and keys for block ciphers: the tweakey framework [C ] // Proceedings of AsiaCrypt 2014 . Cham : Springer , 2014 : 274 - 288 .

DOBRAUNIG C , EICHLSEDER M , MENDEL F . Ascon v1. 2. submission to the CAESAR competition [J ] . Institute for Applied Information Processing and Communications , 2016 , 5 ( 6 ): 7

BIHAM E , BIRYUKOV A , SHAMIR A . Miss in the middle attacks on IDEA and Khufu [C ] // Proceedings of Fast Software Encryption(FSE 1999) . Heidelberg : Springer , 1999 : 124 - 138 .

DERBEZ P , FOUQUE P A . Exhausting demirci-selçuk meet-in-the-middle attacks against reduced-round AES [C ] // Proceedings of FSE 2013 . Heidelberg : Springer , 2014 : 541 - 560 .

ZONG R , DONG X Y . MILP-aided related-tweak/key impossible differential attack and its applications to QARMA, Joltik-BC [J ] . IEEE Access , 2019 , 7 : 153683 - 153693 .

LI R J , JIN C H , PAN H C . Key recovery attacks on reduced-round Joltik-BC in the single-key setting [J ] . Information Processing Letters , 2019 , 151 : 105834 .

LIU Y , SHI Y F , GU D W , et al . Improved meet-in-the-middle attacks on reduced-round Kiasu-BC and Joltik-BC [J ] . The Computer Journal , 2019 , 62 ( 12 ): 1761 - 1776 .

LI M , CHEN S . Improved meet-in-the-middle attacks on reduced round Joltik-BC [J ] . IET Information Security , 2021 , 15 : 247 - 255 .

DAEMEN J ， RIJMEN V . The design of rijndael: AES--the advanced encryption standard [M ] . Berlin, Germany : Springer , 2002 .

KANDA M . Practical security evaluation against differential and linear cryptanalyses for feistel ciphers with SPN round function [C ] // Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography . New York : ACM , 2000 : 324 - 338 .

DIFFIE W , HELLMAN M E . Special feature exhaustive cryptanalysis of the NBS data encryption standard [J ] . Computer , 1977 , 10 ( 6 ): 74 - 84 .

U.S. Department of Commerce , National bureau of standards . data encryption standard [J ] . Computers & Security , 1977 , 6 ( 3 ): 195 - 196 .

DEMIRCI H , SELCUK A A . A meet-in-the-middle attack on 8-round AES [C ] // Proceedings of Fast Software Encryption(FSE 2008) . Heidelberg : Springer , 2008 : 116 - 126 .

GILBERT H , MINIER M . A collision attack on 7 rounds of rijndael [C ] // Proceedings of the Third Advanced Encryption Standard Candidate Conference . Heidelberg : Springer , 2000 : 230 - 241 .

LI L , JIA K , WANG X . Improved single-key attacks on 9-round AES-192/256 [C ] // Proceedings of 21st International Workshop on Fast Software Encryption(FSE 2014) . Heidelberg : Springer , 2014 : 1 - 20 .

LV Y , SHI D P , GUO Y , et al . Automatic demirci–selçuk meet-In-the-middle attack on SIMON [J ] . The Computer Journal , 2023 , 66 ( 12 ): 3052 - 3068 .

SHI D P , SUN S W , SONG L , et al . Exploiting non-full key additions: full-fledged automatic demirci-selcuk meet-in-the-middle cryptanalysis of SKINNY [C ] // Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques . Heidelberg : Springer , 2023 : 67 - 97 .

BOURA C , DAVID N , DERBEZ P , et al . Differential meet-in-the-middle cryptanalysis [C ] // Proceedings of 43rd Annual International Cryptology Conference(CRYPTO 2023) . Heidelberg : Springer , 2023 : 240 - 272 .

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

LowMC实例的差分枚举攻击效果分析

基于密码结构的扩散层构造

MDS矩阵构造方法

自动化搜索ARX密码差分特征的方法