The advancement in the field of technology and science has rendered the classical algorithms used for securing data vulnerable to attacks by quantum computers. Post quantum cryptography aims at establishing quantum safe algorithms so that data can be secured. Advanced Encryption Standard (AES) is a symmetric key block cipher which provides security against known quantum attacks. The Shor’s and Grover’s algorithms are the quantum algorithms which have proved to break encryption provided by security mechanisms like RSA and even have the potential to break AES-128 in future. However, if key size of symmetric key security mechanisms is increased then security provided by them cannot be broken by both classical and quantum computers in near future. Quantum computers are becoming more and more prevalent, but there is still some concern about their security. In this paper, we will show that the current quantum computers in use cannot break AES-256 encryption with Grover’s algorithm. We have implemented AES-256 for encryption of files in our system and proposed a proof that the qubits used by quantum computers are not enough to break AES-256 with Grover’s algorithm. We believe that this provides strong evidence that current quantum computers are not a threat to encrypted data using AES-256. We hope this will ease concerns about using quantum computing for secure applications and encourage further development of these powerful machines.The advancement in the field of technology and science has rendered the classical algorithms used for securing data vulnerable to attacks by quantum computers. Post quantum cryptography aims at establishing quantum safe algorithms so that data can be secured. Advanced Encryption Standard (AES) is a symmetric key block cipher which provides security against known quantum attacks. The Shor’s and Grover’s algorithms are the quantum algorithms which have proved to break encryption provided by security mechanisms like RSA and even have the potential to break AES-128 in future. However, if key size of symmetric key security mechanisms is increased then security provided by them cannot be broken by both classical and quantum computers in near future. Quantum computers are becoming more and more prevalent, but there is still some concern about their security. In this paper, we will show that the current quantum computers in use cannot break AES-256 encryption with Grover’s algorithm. We have implemented AES-256 for encryption of files in our system and proposed a proof that the qubits used by quantum computers are not enough to break AES-256 with Grover’s algorithm. We believe that this provides strong evidence that current quantum computers are not a threat to encrypted data using AES-256. We hope this will ease concerns about using quantum computing for secure applications and encourage further development of these powerful machines.

International Journal of Intelligent Systems and Applications in EngineeringApr 16, 20230 citations

Security of Quantum Cryptography

Anindita Banerjee

Communications in computer and information scienceJan 1, 20201 citation

Secure Composition of Quantum Key Distribution and Symmetric Key Encryption

Kunal Dey, Reihaneh Safavi–Naini

Quantum key distribution (QKD) allows Alice and Bob to share a secret key with proven information-theoretic security. Composability-based security proofs for QKD ensure that using the established key to encrypt a message using a one-time-pad encryption system, will result in information-theoretic secrecy for the communication. In this paper, we consider the problem of using a QKD established key with a secure symmetrickey based encryption system with computational security, and use an extension of the framework of hybrid encryption to prove security of the composition. We use an extension of the original framework of hybrid encryption to correlated randomness setting (Sharifian et al. in ISIT 2021) and propose a quantum-enabled Key Encapsulation Mechanism (qKEM) that is used to construct a quantum-enabled hybrid encryption ( $q H E$ ) system, and prove a composition theorem for the security of the qHE. We construct a qKEM with proven security using an existing QKD (Portmann et al. in Rev. of Mod. Physics 2022). Using this qKEM with a secure Data Encapsulation Mechanism (DEM), that can be constructed using a one-time symmetric key encryption scheme, results in an efficient encryption scheme for unrestricted length messages with proved security against an adversary with access to (efficient) quantum computations. Thus a key-efficient post-quantum secure encryption with proved security and without using any computational assumptions.Quantum key distribution (QKD) allows Alice and Bob to share a secret key with proven information-theoretic security. Composability-based security proofs for QKD ensure that using the established key to encrypt a message using a one-time-pad encryption system, will result in information-theoretic secrecy for the communication. In this paper, we consider the problem of using a QKD established key with a secure symmetrickey based encryption system with computational security, and use an extension of the framework of hybrid encryption to prove security of the composition. We use an extension of the original framework of hybrid encryption to correlated randomness setting (Sharifian et al. in ISIT 2021) and propose a quantum-enabled Key Encapsulation Mechanism (qKEM) that is used to construct a quantum-enabled hybrid encryption ($q H E$) system, and prove a composition theorem for the security of the qHE. We construct a qKEM with proven security using an existing QKD (Portmann et al. in Rev. of Mod. Physics 2022). Using this qKEM with a secure Data Encapsulation Mechanism (DEM), that can be constructed using a one-time symmetric key encryption scheme, results in an efficient encryption scheme for unrestricted length messages with proved security against an adversary with access to (efficient) quantum computations. Thus a key-efficient post-quantum secure encryption with proved security and without using any computational assumptions.

arXiv:2501.08435IEEE International Symposium on Information Theory (ISIT)Jun 22, 20254 citations

Quantum Cryptography at the Computational Frontier

Romain Alléaume

Jun 1, 20180 citations

Advancing Cloud Data Protection with Secure Cryptographic Algorithms

V Sujana, Bindu Madhavi N, Tarun Reddy Nukala

Encryption makes it possible to send private information via unprotected channels without worrying about data loss or modification by unauthorized parties. For data security in various contexts, many encryption algorithms have developed throughout time. This paper focuses on symmetric encryption, often used for key exchange due to its large key size. In the context of data centers and cloud computing, security is paramount. This paper proposes a quantum computing algorithm for encrypting cloud data. This combination leverages quantum computing's rapid complex computations. The quantum computing algorithm offers fast, efficient, and secure data protection in cloud environments, reducing computational power requirements while enhancing overall efficiency. Moreover, it addresses the limitations of traditional encryption methods and provides a scalable solution for large-scale data encryption. By integrating quantum computing, we can achieve unprecedented levels of security and performance. The potential impact of this approach could revolutionize data protection standards in the cloud industry.Encryption makes it possible to send private information via unprotected channels without worrying about data loss or modification by unauthorized parties. For data security in various contexts, many encryption algorithms have developed throughout time. This paper focuses on symmetric encryption, often used for key exchange due to its large key size. In the context of data centers and cloud computing, security is paramount. This paper proposes a quantum computing algorithm for encrypting cloud data. This combination leverages quantum computing's rapid complex computations. The quantum computing algorithm offers fast, efficient, and secure data protection in cloud environments, reducing computational power requirements while enhancing overall efficiency. Moreover, it addresses the limitations of traditional encryption methods and provides a scalable solution for large-scale data encryption. By integrating quantum computing, we can achieve unprecedented levels of security and performance. The potential impact of this approach could revolutionize data protection standards in the cloud industry.

International Journal of Computational Science and Engineering ResearchMay 10, 20250 citations

Quantum Cryptography and Computation

ARTUR K. EKERT

NATO ASI series. Series B : PhysicsJan 1, 19950 citations

q H E

) system, and prove a composition theorem for the security of the qHE. We construct a qKEM with proven security using an existing QKD (Portmann et al. in Rev. of Mod. Physics 2022). Using this qKEM with a secure Data Encapsulation Mechanism (DEM), that can be constructed using a one-time symmetric key encryption scheme, results in an efficient encryption scheme for unrestricted length messages with proved security against an adversary with access to (efficient) quantum computations. Thus a key-efficient post-quantum secure encryption with proved security and without using any computational assumptions.