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

International Journal of Theoretical Physics

Leveraging Grover’s Algorithm for Quantum Searchable Encryption in Cloud Infrastructure and its application in AES Resource Estimation

Mohit Joshi, Manoj Kumar Mishra, S. Karthikeyan

Published Aug 21, 2024• 9 citations
Publisher
DOI
10.1007/s10773-024-05751-3

Related papers

Applying Grover’s Algorithm to AES: Quantum Resource Estimates

Markus Grassl, Brandon Langenberg, Martin Roetteler +1 more

Lecture notes in computer science•Jan 1, 2016•300 citations

Quantum Searchable Encryption for Cloud Data Based on Delegating Quantum Computing

Yinsong Xu, Wenjie Liu, Junxiu Chen +1 more

Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering•Jan 1, 2020•1 citation

Grover algorithm-based quantum homomorphic encryption ciphertext retrieval scheme in quantum cloud computing

Changqing Gong, Du Juan, Zhaoyang Dong +4 more

Quantum Information Processing•Feb 10, 2020•45 citations

Enhancing Healthcare Data Security with Quantum Key Distribution and AES-Based Dynamic Searchable Symmetric Encryption

VENKATESWARLU REDDY P, D.Ganesh, Sindhuja Beduduru +3 more

IEEE International Conference on Intelligent Technologies for a Sustainable and Inclusive Future (ICITSIF)•May 1, 2026•0 citations

Investigating the Impact of Grover's Algorithm on AES S-Box

Nur Fahima Iwani binti Ahmad Irwan, Md Nabil Ahmad Zawawi, Reema Thabit

Quantum computing poses a significant threat to classical cryptographic algorithms, particularly the Advanced Encryption Standard (AES). This study investigates the impact of Grover's algorithm on the AES S-box, a fundamental component of the AES encryption process. By leveraging quantum mechanics, Grover's algorithm can potentially reduce the time required to break AES encryption from 2128operations to 264operations, thus presenting a substantial security risk. This research aims to evaluate the feasibility of such quantum attacks on AES S-box by conducting experiments using virtual quantum simulators. The study examines the resource requirements, including the number of gates and qubits, and assesses the scalability of Grover's algorithm across different data sizes and types. The findings indicate that, while theoretically effective, the practical implementation of Grover's algorithm is currently hindered by significant resource constraints on existing quantum hardware. These results underscore the need for continued advancements in quantum technology and the development of quantum-resistant cryptographic methods to ensure data security in the quantum era. This research contributes to the understanding of quantum vulnerabilities in classical cryptography and supports the development of robust encryption strategies that can withstand future quantum attacks.

International Conference on Knowledge and Systems Engineering/Proceedings•Nov 5, 2024•0 citations

Applying Grover's algorithm to AES: quantum resource estimates

Markus Grassl, Brandon Langenberg, Martin Roetteler +1 more

We present quantum circuits to implement an exhaustive key search for the Advanced Encryption Standard (AES) and analyze the quantum resources required to carry out such an attack. We consider the overall circuit size, the number of qubits, and the circuit depth as measures for the cost of the presented quantum algorithms. Throughout, we focus on Clifford$+T$ gates as the underlying fault-tolerant logical quantum gate set. In particular, for all three variants of AES (key size 128, 192, and 256 bit) that are standardized in FIPS-PUB 197, we establish precise bounds for the number of qubits and the number of elementary logical quantum gates that are needed to implement Grover's quantum algorithm to extract the key from a small number of AES plaintext-ciphertext pairs.

arXiv:1512.04965•Dec 15, 2015•12 citations
Quantum computing poses a significant threat to classical cryptographic algorithms, particularly the Advanced Encryption Standard (AES). This study investigates the impact of Grover's algorithm on the AES S-box, a fundamental component of the AES encryption process. By leveraging quantum mechanics, Grover's algorithm can potentially reduce the time required to break AES encryption from 2128operations to 264operations, thus presenting a substantial security risk. This research aims to evaluate the feasibility of such quantum attacks on AES S-box by conducting experiments using virtual quantum simulators. The study examines the resource requirements, including the number of gates and qubits, and assesses the scalability of Grover's algorithm across different data sizes and types. The findings indicate that, while theoretically effective, the practical implementation of Grover's algorithm is currently hindered by significant resource constraints on existing quantum hardware. These results underscore the need for continued advancements in quantum technology and the development of quantum-resistant cryptographic methods to ensure data security in the quantum era. This research contributes to the understanding of quantum vulnerabilities in classical cryptography and supports the development of robust encryption strategies that can withstand future quantum attacks.
We present quantum circuits to implement an exhaustive key search for the Advanced Encryption Standard (AES) and analyze the quantum resources required to carry out such an attack. We consider the overall circuit size, the number of qubits, and the circuit depth as measures for the cost of the presented quantum algorithms. Throughout, we focus on Clifford+T+T+T gates as the underlying fault-tolerant logical quantum gate set. In particular, for all three variants of AES (key size 128, 192, and 256 bit) that are standardized in FIPS-PUB 197, we establish precise bounds for the number of qubits and the number of elementary logical quantum gates that are needed to implement Grover's quantum algorithm to extract the key from a small number of AES plaintext-ciphertext pairs.