IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i17p2678-d1466134.html
   My bibliography  Save this article

Quantum Attacks on MIBS Block Cipher Based on Bernstein–Vazirani Algorithm

Author

Listed:
  • Huiqin Xie

    (Department of Cryptography Science and Technology, Beijing Electronic Science and Technology Institute, Beijing 100070, China
    Key Laboratory of Cryptography of Zhejiang Province, Hangzhou Normal University, Hangzhou 311121, China)

  • Zhangmei Zhao

    (Department of Cryptography Science and Technology, Beijing Electronic Science and Technology Institute, Beijing 100070, China)

  • Ke Wang

    (Department of Cryptography Science and Technology, Beijing Electronic Science and Technology Institute, Beijing 100070, China)

  • Yanjun Li

    (Information Industry Information Security Evaluation Center, The 15th Research Institute of China Electronics Technology Group Corporation, Beijing 100083, China)

  • Hongcai Xin

    (Department of Cryptography Science and Technology, Beijing Electronic Science and Technology Institute, Beijing 100070, China)

Abstract

Because of the substantial progress in quantum computing technology, the safety of traditional cryptologic schemes is facing serious challenges. In this study, we explore the quantum safety of the lightweight cipher MIBS and propose quantum key-recovery attacks on the MIBS cipher by utilizing Grover’s algorithm and Bernstein–Vazirani algorithm. We first construct linear-structure functions based on the 5-round MIBS cipher according to the characteristics of the linear transformations, and then we obtain a quantum distinguisher of the 5-round MIBS cipher by applying Bernstein–Vazirani algorithm to the constructed functions. Finally, utilizing this distinguisher and Grover’s algorithm, we realize a 7-round key-recovery attack on the MIBS cipher, and then we expand the attack to more rounds of MIBS based on a similar idea. The quantum attack on the 7-round MIBS requires 156 qubits and has a time complexity of 2 10.5 . An 8-round attack requires 179 qubits and has a time complexity of 2 22 . Compared with existing quantum attacks, our attacks have better time complexity when attacking the same number of rounds.

Suggested Citation

  • Huiqin Xie & Zhangmei Zhao & Ke Wang & Yanjun Li & Hongcai Xin, 2024. "Quantum Attacks on MIBS Block Cipher Based on Bernstein–Vazirani Algorithm," Mathematics, MDPI, vol. 12(17), pages 1-20, August.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:17:p:2678-:d:1466134
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/17/2678/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/17/2678/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:12:y:2024:i:17:p:2678-:d:1466134. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.