Improved key-recovery attacks on reduced-round WEM-8

被引:0
|
作者
Jun Liu
Dachao Wang
Yupu Hu
Jie Chen
Baocang Wang
机构
[1] Xidian University,State Key Laboratory of Integrated Service Networks
[2] Guilin University of Electronic Technology,Guangxi Key Laboratory of Cryptography and Information Security
来源
关键词
White-box block cipher; Cryptanalysis; WEM family; Key-recovery attack; 94A60;
D O I
暂无
中图分类号
学科分类号
摘要
Proposed in CT-RSA’2017, WEM is a family of white-box block ciphers based on the Even-Mansour structure and AES. Due to its elegant structure and impressive performance, WEM is a prominent primitive in white-box cryptography-oriented scenarios like digital rights management (DRM) and mobile payment. In this paper, we focus on the black-box key-recovery security of reduced-round WEM-8, one of the main instances in the WEM family, with the aim of gaining an intensive understanding of the security of WEM. Potential weaknesses of WEM-8 are explored, and a new approach to improving the efficiency of integral attacks is introduced, which constructs equations from the constant property, instead of the balance property. Aided by these observations, new competitive key-recovery attacks with lower time/data/memory complexity on reduced-round WEM-8 are proposed. In particular, the improved attack on 4-round WEM-8 requires only 28\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^8$$\end{document} adaptively chosen ciphertexts, whereas the current best attack has the data complexity of 240\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^{40}$$\end{document} chosen plaintexts. The results in this work show the effectiveness of the constant property in enhancing integral attacks and can inspire novel techniques in key-recovery attacks against other (white-box) block ciphers.
引用
收藏
页码:2419 / 2448
页数:29
相关论文
共 50 条
  • [21] Improved meet-in-the-middle attacks on reduced-round Piccolo
    Liu, Ya
    Cheng, Liang
    Liu, Zhiqiang
    Li, Wei
    Wang, Qingju
    Gu, Dawu
    SCIENCE CHINA-INFORMATION SCIENCES, 2018, 61 (03)
  • [22] Improved related-key impossible differential attacks on reduced-round AES-192
    Zhang, Wentao
    Wu, Wenling
    Zhang, Lei
    Feng, Dengguo
    SELECTED AREAS IN CRYPTOGRAPHY, 2007, 4356 : 15 - +
  • [23] Improved meet-in-the-middle attacks on reduced-round DES
    Dunkelman, Orr
    Sekar, Gautharn
    Preneel, Bart
    PROGRESS IN CRYPTOLOGY - INDOCRYPT 2007, 2007, 4859 : 86 - 100
  • [24] Improved meet-in-the-middle attacks on reduced-round Piccolo
    Ya Liu
    Liang Cheng
    Zhiqiang Liu
    Wei Li
    Qingju Wang
    Dawu Gu
    Science China Information Sciences, 2018, 61
  • [25] Key-Recovery Attacks on ASASA
    Brice Minaud
    Patrick Derbez
    Pierre-Alain Fouque
    Pierre Karpman
    Journal of Cryptology, 2018, 31 : 845 - 884
  • [26] Key-Recovery Attacks on ASASA
    Minaud, Brice
    Derbez, Patrick
    Fouque, Pierre-Alain
    Karpman, Pierre
    ADVANCES IN CRYPTOLOGY - ASIACRYPT 2015, PT II, 2015, 9453 : 3 - 27
  • [27] Practical Key-Recovery Attacks On Round-Reduced Ketje Jr, Xoodoo-AE And Xoodyak
    Zhou, Haibo
    Li, Zheng
    Dong, Xiaoyang
    Jia, Keting
    Meier, Willi
    COMPUTER JOURNAL, 2020, 63 (08): : 1231 - 1246
  • [28] Key-Recovery Attacks on ASASA
    Minaud, Brice
    Derbez, Patrick
    Fouque, Pierre-Alain
    Karpman, Pierre
    JOURNAL OF CRYPTOLOGY, 2018, 31 (03) : 845 - 884
  • [29] Full Round Distinguishing and Key-Recovery Attacks on SAND-2
    Zhang, Zhuolong
    Chen, Shiyao
    Wang, Wei
    Wang, Meiqin
    INFORMATION SECURITY AND CRYPTOLOGY, INSCRYPT 2023, PT II, 2024, 14527 : 230 - 250
  • [30] Preimage Attacks on Reduced-Round Stribog
    AlTawy, Riham
    Youssef, Amr M.
    PROGRESS IN CRYPTOLOGY - AFRICACRYPT 2014, 2014, 8469 : 109 - 125