| 引用本文: | 刘亚,刁倩倩,李玮,等.不可能差分分析时间复杂度通用计算公式的改进.[J].国防科技大学学报,2018,40(3):153-158.[点击复制] |
| LIU Ya,DIAO Qianqian,LI Wei,et al.Improved generic formula of time complexity on impossible differential attacks[J].Journal of National University of Defense Technology,2018,40(3):153-158[点击复制] |
|
| |
|
|
| 本文已被：浏览 7179次 下载 5780次 |
| 不可能差分分析时间复杂度通用计算公式的改进 |
| 刘亚1,2,3,4, 刁倩倩1, 李玮4, 刘志强5, 曾志强6 |
|
(1. 上海理工大学 光电信息与计算机工程学院， 上海 200093;2.
2. 上海理工大学 光学仪器与系统教育部工程研究中心 上海市现代化光学系统重点实验室， 上海 200093;3.
3. 上海交通大学 计算机科学与工程系， 上海 200240;4. 东华大学 计算机科学与技术学院， 上海 201620;5.3. 上海交通大学 计算机科学与工程系， 上海 200240;6.5. 信息保障技术重点实验室， 北京 100072)
|
| 摘要: |
| 研究Boura等和Derbez分别提出的不可能差分分析时间复杂度计算公式，根据实际攻击过程优化密钥排除的步骤，给出不可能差分分析实际攻击的时间复杂度计算的改进公式，进而利用两个分组密码算法模型将改进后公式计算的实际结果分别与Boura等的公式和Derbez的公式的计算结果进行对比，结果表明Boura等的公式计算结果既可能高于优化公式的实际分析计算的结果，也可能低于优化公式的实际分析计算的结果，而在轮子密钥独立时改进后公式的实际计算结果是Derbez公式的计算结果的2-1.2倍。 |
| 关键词: 分组密码 不可能差分分析 不可能差分链 时间复杂度 |
| DOI：10.11887/j.cn.201803024 |
| 投稿日期：2017-04-10 |
| 基金项目:国家自然科学基金资助项目(61402288，61672347，61472250，61302161)；上海市自然科学基金资助项目(15ZR1400300)；〖JP〗信息保障技术重点实验室开放基金资助项目（KJ-17-008） |
|
| Improved generic formula of time complexity on impossible differential attacks |
| LIU Ya1,2,3, DIAO Qianqian1, LI Wei4, LIU Zhiqiang5, ZENG Zhiqiang6 |
|
(1. School of OpticalElectrical and Computer Engineering, University of Shanghai for Science and Technology, Shanghai 200093, China;2.
2. Shanghai Key Lab of Modern Optical System, Engineering Research Center of Optical Instrument and System,
Ministry of Education, University of Shanghai for Science and Technology, Shanghai 200093, China;3.
3. Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200240, China;4. School of Computer Science and Technology, Donghua University, Shanghai 201602, China;5.3. Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200240, China;6.5. Science and Technology on Assurance Laboratory, Beijing 100072, China)
|
| Abstract: |
| The previous formulas of the time complexity of impossible differential cryptanalysis proposed by Boura et al. and Derbez were researched respectively. By studying the filtration of round subkeys during the attacking procedure carefully, an improved formula estimated the real time complexity of impossible differential cryptanalysis was proposed. On this basis, the impossible differential attacks were mounted on two models of block ciphers and the time complexities by three formulas were calculated. The results show that the time complexity computed by Boura′s formula can be higher or lower than the real time complexity, and the real time complexity is 2-1.2 times as big as the time complexity calculated by Derbez′s formula if the round subkeys are independent of each other. |
| Keywords: block ciphers impossible differential attacks impossible differentials time complexity |
|
|
|
|
|
