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

IEEE Uttar Pradesh Section International Conference on Electrical, Electronics and Computer Engineering (UPCON)

Quantum Computing: The Future of Secure Data Encryption and Problem Solving

Chennakeshi Ganesh, Shahanawaj Ahamad, Vivek Veeraiah, K O Thejaswini, Sheetal Pradip Patil, Arpit Namdev

Published Nov 29, 2024• 0 citations
Publisher

Abstract

Data encryption and challenging problemsolving might be transformed by quantum computing This research suggests that the ability of quantum computers to examine enormous amounts of data at hitherto unheard-of speeds may revolutionize optimization and encryption. For post-quantum data security, quantum cryptography—more especially, QKD-offers perfect encryption. The study also looks at quantum algorithms like Grover's and Shor's, which ten-fold faster than traditional computers solve. Additionally discussed are quantum hardware development concerns and how they affect military, finance, and healthcare. This work implements Python's conventional and quantum encryption using Qiskit. Security, encryption/decryption time, key management/distribution complexity, and mistake rate are evaluated among AES, DES, RSA, and QKD. Future-proof security would find QKD ideal given its classical and quantum resistance. RSA and AES both fight cryptanalysis and bruteforce. From conventional assaults, RSA is secure; yet, quantum threats such as Shor's method could compromise it. With its 56-bit key length unsuitable for contemporary encryption, DES receives the lowest security score. The most effective is AES as it encrypts and decodes fast and cheaply. DES lacks security, hence it is unsuitable for current uses even if it is efficient. RSA is inefficient as larger key sizes impede encryption and decoding. Third in efficiency is QKD because of overhead and quantum channel key distribution complexity. Though key distribution is slower than in AES and DES, it is safer. The comparison reveals for every method security, efficiency, and error rate advantages as well as drawbacks.

DOI
10.1109/upcon62832.2024.10983883

Related papers

QUANTUM COMPUTING AND CRYPTOGRAPHY: FUTURE-PROOFING INFORMATION SECURITY PROTOCOLS

Dr. Adeel Ahmed

Quantum computing has emerged as a disruptive technology with the potential to revolutionize various fields, including information security. Traditional cryptographic protocols, including RSA, ECC, and AES, rely on the difficulty of certain mathematical problems for their security. However, the advent of quantum computing poses a significant threat to these encryption methods, as quantum algorithms such as Shor's and Grover's algorithms can efficiently solve problems that are computationally hard for classical systems. This paper explores the implications of quantum computing on existing cryptographic systems and proposes strategies for future-proofing information security protocols. We examine the vulnerabilities introduced by quantum computing, highlight the role of post-quantum cryptography (PQC), and explore quantum key distribution (QKD) as potential solutions for ensuring the confidentiality, integrity, and authenticity of digital communications. The paper discusses various quantum-resistant algorithms and offers insights into the ongoing efforts by international standardization bodies to prepare for a post-quantum world.

Multidisciplinary Research in Computing Information Systems•Oct 3, 2024•0 citations

The Influence Of Quantum Computing Advancements On Future Cloud Encryption Models

Ananya Paul

Quantum computing represents one of the most profound technological shifts in modern computing, offering immense computational power that has the potential to disrupt existing security frameworks. Its ability to solve complex mathematical problems exponentially faster than classical systems poses a significant threat to current encryption standards widely used in cloud environments. Traditional cryptographic algorithms such as RSA, ECC, and AES, which form the backbone of cloud security, are vulnerable to quantum algorithms like Shor's and Grover's, capable of breaking or weakening encryption keys. This article explores the influence of quantum computing advancements on the future of cloud encryption models. It reviews the vulnerabilities of classical cryptographic methods under quantum conditions, examines emerging quantum-resistant and quantum-safe encryption approaches, and discusses their applicability to cloud infrastructure. The paper also highlights current research trends, the progress of post-quantum cryptography (PQC) standardization, and the role of quantum key distribution (QKD) in achieving unbreakable communication. By evaluating both the risks and opportunities introduced by quantum computing, this study underscores the urgent need for organizations to adopt quantum-resilient encryption mechanisms. The paper concludes that while quantum computing introduces new challenges to data confidentiality, it also drives innovation toward developing next-generation cloud encryption frameworks that ensure long-term security in a post-quantum world.

•Jan 1, 2018•0 citations

The influence of quantum computing advancements on future cloud encryption models

Ananya Paul

Quantum computing represents one of the most profound technological shifts in modern computing, offering immense computational power that has the potential to disrupt existing security frameworks. Its ability to solve complex mathematical problems exponentially faster than classical systems poses a significant threat to current encryption standards widely used in cloud environments. Traditional cryptographic algorithms such as RSA, ECC, and AES, which form the backbone of cloud security, are vulnerable to quantum algorithms like Shor’s and Grover’s, capable of breaking or weakening encryption keys. This article explores the influence of quantum computing advancements on the future of cloud encryption models. It reviews the vulnerabilities of classical cryptographic methods under quantum conditions, examines emerging quantum-resistant and quantum-safe encryption approaches, and discusses their applicability to cloud infrastructure. The paper also highlights current research trends, the progress of post-quantum cryptography (PQC) standardization, and the role of quantum key distribution (QKD) in achieving unbreakable communication. By evaluating both the risks and opportunities introduced by quantum computing, this study underscores the urgent need for organizations to adopt quantum-resilient encryption mechanisms. The paper concludes that while quantum computing introduces new challenges to data confidentiality, it also drives innovation toward developing next-generation cloud encryption frameworks that ensure long-term security in a post-quantum world.

International Journal of Science Engineering and Technology•Dec 5, 2018•0 citations

Quantum Computing and Its Implications for Cryptography: Assessing the Security and Efficiency of Quantum Algorithms

K. L. Sumathy, M. Megala, Sasanko Sekhar Gantayat +1 more

Quantum computing can be regarded as a disruptive enabling technology that can pose a threat to traditional cryptography as it invented new approaches to encrypt data. This paper will compare the level of security that accompanies quantum algorithms as well as the level of efficiency. Specifically, we examine the impact of efficient quantum computing on traditional cryptography and propose techniques against quantum invasions. Four quantum algorithms are analyzed for their efficiency and security benefits in the post-quantum era: Grover’s Algorithm, Shor’s Algorithm, The Quantum Key Distribution (QKD), Lattice-based cryptography. The results reveal that Grover’s algorithm improves search time complexity from O(n) to O(√n), which is advantageous over large data sets. As it will be clear shortly, Shor’s algorithm challenges RSA encryption because it outperforms classical algorithms in factoring large integers. QKD presents secure key exchange protocols that cannot be breached notwithstanding the attempts made using quantum computing. Lattice-based schemes are quantum-resistant alternatives based on the security of certain hard mathematical problems. Based on our experimental results, computational efficiency can be improved, but new cryptographic systems will have to be developed for the mitigation of quantum-related vulnerabilities. This research shows the importance of quantum-resistant cryptographic techniques to ensure data security in the emerging quantum computing era.

Nanotechnology Perceptions•Dec 1, 2024•0 citations

Quantum computing: Cryptographic perspective

Mayank Purohit, Rahul Singh Chauhan, Ruchira Rawat +2 more

Quantum computers with the ability to solve difficult mathematical problems exponentially faster pose an immediate danger to conventional encryption procedures, which are currently thought to be secure in the world of classical computing. This paper explores the fundamental effects of quantum computing on cryptography, showing how quantum algorithms, like Shor's algorithm, may effectively factor big numbers and solve discrete logarithm issues, making popular encryption techniques susceptible. The study looks into how susceptible traditional encryption methods like RSA and ECC are to quantum assaults, highlighting how urgent it is to switch to quantum-resistant cryptographic solutions. This paper also presents an overview of quantum-resistant cryptographic algorithms currently being developed, and investigates quantum key distribution (QKD) protocols as a viable countermeasure. This study highlights the urgent requirement for a proactive strategy in creating quantum-safe cryptographic standards by examining the difficulties presented by quantum computing and assessing the possible directions in post-quantum cryptography. The results underline the need for a united effort from academics, business leaders, and governments to lessen the imminent threat posed by quantum computers and safeguard the integrity and security of digital communication in the future.

International Conference on Control, Computing, Communication and Materials (ICCCCM)•Aug 10, 2024•0 citations

QUANTUM CRYPTOGRAPHY: SECURING DATA IN THE POST-QUANTUM COMPUTING ERA – A COMPREHENSIVE EXPLORATION OF THE FUTURE OF CYBERSECURITY

Nadia Mustaqim Ansari, Talha Tariq, Rizwan Iqbal +3 more

Classical cryptographic systems face a hazardous situation because quantum computing operates as a threat vector against classical systems through Shor's and Grover's algorithms. Through Shor's algorithm factoring large integers results in a breach of RSA encryption methods whereas Grover's algorithm enables substantially quicker searches of unsorted databases to diminish symmetric key encryption strength. The advanced features of quantum systems eliminate the foundation of security that classical cryptographic techniques depend on computation complexity for protection. Quantum Key Distribution (QKD) under the principles of quantum mechanics presents an effective solution through quantum cryptography for achieving secure communication. QKD stands apart from classical systems through its complete security because attempts at quantum channel interception automatically disable transmitted information and notifies sender and receiver. The successful deployment of quantum cryptography needs solutions for its high implementation expenses coupled with noise sensitivity along with scalability limitations. The research shows it is vital to actively implement quantum-resistant cryptography now because it will protect sensitive data as the post-quantum computing period begins thus securing global cyberspace infrastructure protection systems. The study demonstrates both promising speed benefits of Hash-Based cryptography but Code-Based cryptography encounters deployment barriers because of its performance restrictions. Future studies must focus on performance development of PQC mechanisms to boost operational speed and sustain security standards.

Kashf Journal of Multidisciplinary Research•Feb 6, 2025•2 citations
Data encryption and challenging problemsolving might be transformed by quantum computing This research suggests that the ability of quantum computers to examine enormous amounts of data at hitherto unheard-of speeds may revolutionize optimization and encryption. For post-quantum data security, quantum cryptography—more especially, QKD-offers perfect encryption. The study also looks at quantum algorithms like Grover's and Shor's, which ten-fold faster than traditional computers solve. Additionally discussed are quantum hardware development concerns and how they affect military, finance, and healthcare. This work implements Python's conventional and quantum encryption using Qiskit. Security, encryption/decryption time, key management/distribution complexity, and mistake rate are evaluated among AES, DES, RSA, and QKD. Future-proof security would find QKD ideal given its classical and quantum resistance. RSA and AES both fight cryptanalysis and bruteforce. From conventional assaults, RSA is secure; yet, quantum threats such as Shor's method could compromise it. With its 56-bit key length unsuitable for contemporary encryption, DES receives the lowest security score. The most effective is AES as it encrypts and decodes fast and cheaply. DES lacks security, hence it is unsuitable for current uses even if it is efficient. RSA is inefficient as larger key sizes impede encryption and decoding. Third in efficiency is QKD because of overhead and quantum channel key distribution complexity. Though key distribution is slower than in AES and DES, it is safer. The comparison reveals for every method security, efficiency, and error rate advantages as well as drawbacks.
Quantum computing has emerged as a disruptive technology with the potential to revolutionize various fields, including information security. Traditional cryptographic protocols, including RSA, ECC, and AES, rely on the difficulty of certain mathematical problems for their security. However, the advent of quantum computing poses a significant threat to these encryption methods, as quantum algorithms such as Shor's and Grover's algorithms can efficiently solve problems that are computationally hard for classical systems. This paper explores the implications of quantum computing on existing cryptographic systems and proposes strategies for future-proofing information security protocols. We examine the vulnerabilities introduced by quantum computing, highlight the role of post-quantum cryptography (PQC), and explore quantum key distribution (QKD) as potential solutions for ensuring the confidentiality, integrity, and authenticity of digital communications. The paper discusses various quantum-resistant algorithms and offers insights into the ongoing efforts by international standardization bodies to prepare for a post-quantum world.
Quantum computing represents one of the most profound technological shifts in modern computing, offering immense computational power that has the potential to disrupt existing security frameworks. Its ability to solve complex mathematical problems exponentially faster than classical systems poses a significant threat to current encryption standards widely used in cloud environments. Traditional cryptographic algorithms such as RSA, ECC, and AES, which form the backbone of cloud security, are vulnerable to quantum algorithms like Shor's and Grover's, capable of breaking or weakening encryption keys. This article explores the influence of quantum computing advancements on the future of cloud encryption models. It reviews the vulnerabilities of classical cryptographic methods under quantum conditions, examines emerging quantum-resistant and quantum-safe encryption approaches, and discusses their applicability to cloud infrastructure. The paper also highlights current research trends, the progress of post-quantum cryptography (PQC) standardization, and the role of quantum key distribution (QKD) in achieving unbreakable communication. By evaluating both the risks and opportunities introduced by quantum computing, this study underscores the urgent need for organizations to adopt quantum-resilient encryption mechanisms. The paper concludes that while quantum computing introduces new challenges to data confidentiality, it also drives innovation toward developing next-generation cloud encryption frameworks that ensure long-term security in a post-quantum world.
Quantum computing represents one of the most profound technological shifts in modern computing, offering immense computational power that has the potential to disrupt existing security frameworks. Its ability to solve complex mathematical problems exponentially faster than classical systems poses a significant threat to current encryption standards widely used in cloud environments. Traditional cryptographic algorithms such as RSA, ECC, and AES, which form the backbone of cloud security, are vulnerable to quantum algorithms like Shor’s and Grover’s, capable of breaking or weakening encryption keys. This article explores the influence of quantum computing advancements on the future of cloud encryption models. It reviews the vulnerabilities of classical cryptographic methods under quantum conditions, examines emerging quantum-resistant and quantum-safe encryption approaches, and discusses their applicability to cloud infrastructure. The paper also highlights current research trends, the progress of post-quantum cryptography (PQC) standardization, and the role of quantum key distribution (QKD) in achieving unbreakable communication. By evaluating both the risks and opportunities introduced by quantum computing, this study underscores the urgent need for organizations to adopt quantum-resilient encryption mechanisms. The paper concludes that while quantum computing introduces new challenges to data confidentiality, it also drives innovation toward developing next-generation cloud encryption frameworks that ensure long-term security in a post-quantum world.
Quantum computing can be regarded as a disruptive enabling technology that can pose a threat to traditional cryptography as it invented new approaches to encrypt data. This paper will compare the level of security that accompanies quantum algorithms as well as the level of efficiency. Specifically, we examine the impact of efficient quantum computing on traditional cryptography and propose techniques against quantum invasions. Four quantum algorithms are analyzed for their efficiency and security benefits in the post-quantum era: Grover’s Algorithm, Shor’s Algorithm, The Quantum Key Distribution (QKD), Lattice-based cryptography. The results reveal that Grover’s algorithm improves search time complexity from O(n) to O(√n), which is advantageous over large data sets. As it will be clear shortly, Shor’s algorithm challenges RSA encryption because it outperforms classical algorithms in factoring large integers. QKD presents secure key exchange protocols that cannot be breached notwithstanding the attempts made using quantum computing. Lattice-based schemes are quantum-resistant alternatives based on the security of certain hard mathematical problems. Based on our experimental results, computational efficiency can be improved, but new cryptographic systems will have to be developed for the mitigation of quantum-related vulnerabilities. This research shows the importance of quantum-resistant cryptographic techniques to ensure data security in the emerging quantum computing era.
Quantum computers with the ability to solve difficult mathematical problems exponentially faster pose an immediate danger to conventional encryption procedures, which are currently thought to be secure in the world of classical computing. This paper explores the fundamental effects of quantum computing on cryptography, showing how quantum algorithms, like Shor's algorithm, may effectively factor big numbers and solve discrete logarithm issues, making popular encryption techniques susceptible. The study looks into how susceptible traditional encryption methods like RSA and ECC are to quantum assaults, highlighting how urgent it is to switch to quantum-resistant cryptographic solutions. This paper also presents an overview of quantum-resistant cryptographic algorithms currently being developed, and investigates quantum key distribution (QKD) protocols as a viable countermeasure. This study highlights the urgent requirement for a proactive strategy in creating quantum-safe cryptographic standards by examining the difficulties presented by quantum computing and assessing the possible directions in post-quantum cryptography. The results underline the need for a united effort from academics, business leaders, and governments to lessen the imminent threat posed by quantum computers and safeguard the integrity and security of digital communication in the future.
Classical cryptographic systems face a hazardous situation because quantum computing operates as a threat vector against classical systems through Shor's and Grover's algorithms. Through Shor's algorithm factoring large integers results in a breach of RSA encryption methods whereas Grover's algorithm enables substantially quicker searches of unsorted databases to diminish symmetric key encryption strength. The advanced features of quantum systems eliminate the foundation of security that classical cryptographic techniques depend on computation complexity for protection. Quantum Key Distribution (QKD) under the principles of quantum mechanics presents an effective solution through quantum cryptography for achieving secure communication. QKD stands apart from classical systems through its complete security because attempts at quantum channel interception automatically disable transmitted information and notifies sender and receiver. The successful deployment of quantum cryptography needs solutions for its high implementation expenses coupled with noise sensitivity along with scalability limitations. The research shows it is vital to actively implement quantum-resistant cryptography now because it will protect sensitive data as the post-quantum computing period begins thus securing global cyberspace infrastructure protection systems. The study demonstrates both promising speed benefits of Hash-Based cryptography but Code-Based cryptography encounters deployment barriers because of its performance restrictions. Future studies must focus on performance development of PQC mechanisms to boost operational speed and sustain security standards.