Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Springer eBooks

Quantum Cryptanalysis of Symmetric-Key Ciphers: Background and Challenges

Debranjan Pal, Anubhab Baksi, Anindya Ganguly

Published Jan 1, 2025• 2 citations
Publisher
DOI
10.1007/978-981-96-4948-8_9

Related papers

Quantum cryptanalytic attacks of symmetric ciphers: A review

Ashwini Kumar Malviya, Namita Tiwari, Meenu Chawla

Computers & Electrical Engineering•Jun 7, 2022•16 citations

An Efficient Quantum cryptanalysis of lightweight hash function - PHOTON-Beetle

Swamy Naidu Allu, Appala Naidu Tentu, Gangadhara Rao Kancharla

Quantum cryptanalysis methods are used to crack the majority of symmetric key ciphers. With this knowledge, cryptologists should be able to create post-quantum symmetric ciphers by incorporating these new quantum cryptanalysis techniques into their toolkit. Secure communication is crucial for applications related to the Internet of Things (IoT) to avoid cyberattacks. Cryptographic hash functions can be used to protect data integrity. The development of large-scale, fault-tolerant quantum computers is the most significant challenge. Recent techniques to attack symmetric key schemes can be achieved by using the Pre-image attack method, Simon’s algorithm, or by combining Simon’s and Grover’s algorithms. In this study, we explored some of the most recent methods for quantum cryptanalysis of symmetric key ciphers. Firstly, we discussed the design of quantum cryptanalysis methods, along with the advantages over classical procedures. In this paper, we illustrate the implementation of the NIST-standard lightweight hash function PHOTON-Beetle on a Quantum Computer (using IBM Qiskit), which is mostly used in IoT devices. Efficient quantum implementation of PHOTON-Beetle is proposed in this paper. This paper calculates the quantum cost of PHOTON-Beetle for every layer and compares it with [1].

International Conference on Automation, Computing and Renewable Systems (ICACRS)•Dec 11, 2023•1 citation

Quantum-Inspired Cryptanalysis of Classical Symmetric Ciphers

Jincheng Zhang

This paper explores a novel approach to cryptanalysis of classical symmetric ciphers, drawing inspiration from the principles of quantum mechanics, specifically superposition and interference. Traditional cryptanalytic techniques often rely heavily on statistical analysis of ciphertext and key, which can be effective against less sophisticated ciphers but may prove inadequate against modern designs. We propose a methodology that leverages these quantum concepts to analyze the statistical properties of the cipher's internal states, aiming to identify subtle vulnerabilities that conventional methods might overlook. The core of this approach involves treating the cipher's internal state as a superposition of possible values, subject to interference effects. This allows us to evaluate the probability of different key-state combinations in a fundamentally different way. The goal is not to break the cipher directly, but to create a new lens through which to examine its statistical behavior, potentially revealing weaknesses that could be exploited. This work represents a significant departure from standard cryptanalytic techniques and offers a potentially fruitful avenue for research into the security of classical ciphers in an era where quantum computing poses a growing threat. We present a theoretical framework and outline a methodology for applying this approach, highlighting the potential advantages and challenges.

•Sep 5, 2026•0 citations

Implementation and Analysis of Ciphers in Quantum Computing

Anubhab Baksi, Kyungbae Jang

Computer architecture and design methodologies•Jan 1, 2024•5 citations

Quantum Related-Key Attack Based on Simon’s Algorithm and Its Applications

Ping Zhang

With the development of quantum technology, quantum computing has an increasingly significant impact on cryptanalysis. Several quantum algorithms, such as Simon’s algorithm, Grover’s algorithm, the Bernstein–Vazirani algorithm, Shor’s algorithm, and the Grover-meets-Simon algorithm, have been proposed successively. However, almost all cryptanalysis is based on the quantum chosen-plaintext attack (qCPA) model. This paper focuses on a powerful cryptanalytic model, quantum related-key attack (qRKA), and proposes a strategy of qRKAs against symmetric ciphers using Simon’s algorithm. We construct a periodic function to efficiently recover the secret key of symmetric ciphers if the attacked symmetric ciphers satisfy Simon’s promise, and present the complexity analysis on specific symmetric ciphers. Then, we apply qRKA to the Even–Mansour cipher and SoEM construction, recover their secret keys, and show their complexity comparison in the distinct attack models. This work is of great significance for the qRKA cryptanalysis of existing provably secure cryptographic schemes and the design of future quantum secure cryptographic schemes.

Symmetry•Apr 24, 2023•6 citations

Quantum Cryptanalysis: A Comparative Study

Evangelos Mavridis

•Sep 8, 2026•0 citations
Quantum cryptanalysis methods are used to crack the majority of symmetric key ciphers. With this knowledge, cryptologists should be able to create post-quantum symmetric ciphers by incorporating these new quantum cryptanalysis techniques into their toolkit. Secure communication is crucial for applications related to the Internet of Things (IoT) to avoid cyberattacks. Cryptographic hash functions can be used to protect data integrity. The development of large-scale, fault-tolerant quantum computers is the most significant challenge. Recent techniques to attack symmetric key schemes can be achieved by using the Pre-image attack method, Simon’s algorithm, or by combining Simon’s and Grover’s algorithms. In this study, we explored some of the most recent methods for quantum cryptanalysis of symmetric key ciphers. Firstly, we discussed the design of quantum cryptanalysis methods, along with the advantages over classical procedures. In this paper, we illustrate the implementation of the NIST-standard lightweight hash function PHOTON-Beetle on a Quantum Computer (using IBM Qiskit), which is mostly used in IoT devices. Efficient quantum implementation of PHOTON-Beetle is proposed in this paper. This paper calculates the quantum cost of PHOTON-Beetle for every layer and compares it with [1].
This paper explores a novel approach to cryptanalysis of classical symmetric ciphers, drawing inspiration from the principles of quantum mechanics, specifically superposition and interference. Traditional cryptanalytic techniques often rely heavily on statistical analysis of ciphertext and key, which can be effective against less sophisticated ciphers but may prove inadequate against modern designs. We propose a methodology that leverages these quantum concepts to analyze the statistical properties of the cipher's internal states, aiming to identify subtle vulnerabilities that conventional methods might overlook. The core of this approach involves treating the cipher's internal state as a superposition of possible values, subject to interference effects. This allows us to evaluate the probability of different key-state combinations in a fundamentally different way. The goal is not to break the cipher directly, but to create a new lens through which to examine its statistical behavior, potentially revealing weaknesses that could be exploited. This work represents a significant departure from standard cryptanalytic techniques and offers a potentially fruitful avenue for research into the security of classical ciphers in an era where quantum computing poses a growing threat. We present a theoretical framework and outline a methodology for applying this approach, highlighting the potential advantages and challenges.
With the development of quantum technology, quantum computing has an increasingly significant impact on cryptanalysis. Several quantum algorithms, such as Simon’s algorithm, Grover’s algorithm, the Bernstein–Vazirani algorithm, Shor’s algorithm, and the Grover-meets-Simon algorithm, have been proposed successively. However, almost all cryptanalysis is based on the quantum chosen-plaintext attack (qCPA) model. This paper focuses on a powerful cryptanalytic model, quantum related-key attack (qRKA), and proposes a strategy of qRKAs against symmetric ciphers using Simon’s algorithm. We construct a periodic function to efficiently recover the secret key of symmetric ciphers if the attacked symmetric ciphers satisfy Simon’s promise, and present the complexity analysis on specific symmetric ciphers. Then, we apply qRKA to the Even–Mansour cipher and SoEM construction, recover their secret keys, and show their complexity comparison in the distinct attack models. This work is of great significance for the qRKA cryptanalysis of existing provably secure cryptographic schemes and the design of future quantum secure cryptographic schemes.