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

WITHDRAWN: Implementation of Encryption Algorithms in Classical and Quantum Computing: A comparative Analysis

Jayavrinda Vrindavanam Akshay, Anirudh Narayanan, N. Chandrashekar, Gaurav Kamath, M R Akshay

Published Apr 16, 2024• 1 citation
Publisher

Abstract

Abstract In the overall context of enhanced application of quantum computing into multitude of areas, the paper explores and implements classical encryption algorithms both in traditional and quantum computing environments. Towards this, the classical encryption algorithms such as Blowfish, RSA and ECC are executed in both classical and quantum environments. The result shows that the key generated in the classical hardware is limited to 64-bit as envisaged; the quantum key is generated found to be complex as the instruction set changes from classical instruction set to quantum instruction set. Further, the additional factor of randomness in quantum computing increases the security of the cipher text, which is transmitted over the internet, showing insights for practical applications.

DOI
10.21203/rs.3.rs-4252438/v1

Related papers

Implementation and Evaluation of Quantum-Vulnerable and Quantum-Safe Cryptographic Algorithms

Rakesh Singh T., Hemalatha Eedi

The growing threat of quantum computing to classical cryptographic systems such as RSA and ECC has led to an urgent need for post-quantum cryptographic (PQC) research and implementation. The base paper, “Quantum Computing in Cryptography”, identified a major research gap - the lack of practical implementation of post-quantum algorithms, emphasizing that most existing works remain at a theoretical level. Addressing this gap, we develop and execute a practical benchmarking framework that compares classical RSA and simulated post-quantum cryptographic algorithms. The implementation integrates automatic setup, execution, and visualization of key generation, encryption, and decryption operations for both classical and PQC schemes. Experimental results demonstrate that while RSA achieves faster computational performance, it becomes vulnerable to quantum computational attacks. Conversely, post-quantum algorithms, though more computationally demanding, exhibit strong resistance against such attacks. The performance analysis highlights the trade-off between speed and quantum resilience, confirming the practical viability of PQC for future-proof cryptographic systems. This work effectively bridges the theoretical–practical divide noted in the base paper by providing a concrete, implementable model for evaluating post-quantum cryptography under realistic computational conditions.

International Journal of Computing Algorithm•Aug 25, 2026•0 citations

Advancing Data Security: A Comparative Study of Classical and Post-Quantum Encryption Algorithms

I.S. Pallavi, Pakalapati Ratna Pavani, Polaki Venkata Rao +3 more

The classical encryption systems are shrouded in darkness with the so-rapid development of the methods of computing and the innovation of quantum computer. Classical cryptographic protocols such as RSA, AES and ECC have been on the data security programs over years and their resistance against any classical attack is well known. Nonetheless, these new algorithms are getting more threatened when quantum threats exist which can take advantage of the mathematical structures on which traditional cryptography has been developed. We provide an in-depth comparison of the classical vs post-quantum encryption algorithms speed, computation difficulty, scalability and degree to which they are susceptible to quantum attacks. The summary also encompasses both post-quantum, lattice breaking procedures and assaults to code-based and hash-based cryptographic structures. The experimental results and theoretical analysis both demonstrate the trade-off of security strength, key size, implicit execution complexity of both paradigms. These results can be used to inform the construction of highly sought after hybrid cryptographic protocols that guarantee data confidentiality along with integrity when classical and quantum machines are present.

International Conference on Intelligent Computing, Information and Control Systems (ICOIICS)•Nov 19, 2025•1 citation

Comparative Study of Cryptographic Algorithms in Post Quantum Computing Landscape

Anshuman Sahoo, Indira Kumar A K, Shinu M. Rajagopal

As the advent of quantum computing looms, the cryptographic landscape faces unprecedented challenges that could render traditional algorithms like AES, RSA, and ECC vulnerable. This paper delves into a comparative study of these classical cryptographic algorithms, examining their foundational principles and evaluating their resilience against quantum computing threats, particularly Shor’s and Grover’s algorithms. Through a combination of theoretical analysis and practical simulations, we assess the potential weaknesses and strengths of AES, RSA, and ECC in the post-quantum era. The study highlights the need for quantum-resistant cryptographic methods and explores how current algorithms can be adapted or replaced to withstand the sophisticated computational capabilities of quantum computers. By bridging the gap between classical and quantum cryptography, this research offers crucial insights into the future of secure digital communication, underscoring the urgency for innovation in cryptographic practices to safeguard data in an increasingly quantum-dominated world.

International Conference on Data Intelligence and Cognitive Informatics (ICDICI)•Nov 18, 2024•10 citations

The Implications of Quantum Computing on Conventional Encryption Techniques: Investigation of Cybersecurity Risks and Security Measures

Karthikeyan Gurunathan, Sandhya Murali Parthasarathy, Sathiyandrakumar Srinivasan

Quantum computing is a transformational technology once implemented, capable of addressing problems far beyond the capacity of classical computers. But this progress is also a real challenge to the core of today's modern security. Traditional cryptographic algorithms, such as those based on RSA, ECC, and Diffie-Hellman key exchange, are based on the computational hardness of problems such as prime factorization and discrete logarithms that quantum algorithms solve in polynomial time. As a particular research interesting example, with Shor's Algorithm one can factorize large numbers efficiently, rendering insecure the majority of public key cryptosystems used nowadays. This urgently demands a reevaluation of existing encryption schemes in the context of a post-quantum world. In this paper, we take a closer look at the threats that quantum computers pose to classical security infrastructure including encryption scheme and explore the impact that quantum computation can have on current cryptographic schemes. It calculates the cost in terms of symmetric and asymmetric security, accounting for effects of both Shor's and Grover's algorithms. Symmetric key systems such as AES are also harder hit—Grover's algorithm can give only a quadratic speedup here—but they do need to double key sizes for a sufficient level of post-quantum security. In reaction to those threats, the paper investigates nextgeneration post-quantum cryptographic (PQC) solutions resistant to quantum cryptanalysis. Lattice-based cryptosystems, hash-based signature schemes, multivariate polynomial systems, and code-based cryptosystems are some of the candidates that are being considered in international standardization work, including especially at NIST. In this paper, we compare those alternatives for security, performance, scalability, and feasibility of implementation in real system. An important aspect of this contribution is a comparative study of traditional and post-quantum cryptographic protocols in the context of a number of cybersecurity applications, including secure communications, blockchain networks and IoT contexts. It also covers the quantum readiness timeline and transitional issues, such as backward compatibility, standardization lag and the associated increased computational overhead. Through a mitigated risk evaluation and cryptanalytic attack simulation based on quantum-inspired algorithms, this analysis emphasizes the need to prepare ourselves against quantum-induced security issues. It provides strategic guidance to organizations as they plan for the post-quantum future, stressing cryptographic agility, hybrid encryption models and real-time threat monitoring. Ultimately, the results of this work add to the worldwide conversation on establishing secure systems within the digital age of quantum computing and recommend proactive migration plans for the integrity, confidentiality, and trust one should have in the future cyber world.

IEEE International Conference on ICT in Business Industry & Government (ICTBIG)•Dec 12, 2025•0 citations

A cryptographic analysis of quantum computing

Mayank Purohit, Rahul Singh Chauhan, Ruchira Rawat

The advent of quantum computing ushers in a new era of computational capability and challenges the fundamental principles of modern cryptography. 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.

CRC Press eBooks•Nov 19, 2024•2 citations

WITHDRAWN: Implementation of Encryption Algorithms in Classical and Quantum Computing: A comparative Analysis

Jayavrinda Vrindavanam Akshay, Anirudh Narayanan, N. Chandrashekar +2 more

Abstract The full text of this preprint has been withdrawn by the authors since they no longer stand by the findings/conclusions of this work. Therefore, the authors do not wish this work to be cited as a reference. Questions should be directed to the corresponding author.

•Jul 11, 2024•0 citations
Abstract In the overall context of enhanced application of quantum computing into multitude of areas, the paper explores and implements classical encryption algorithms both in traditional and quantum computing environments. Towards this, the classical encryption algorithms such as Blowfish, RSA and ECC are executed in both classical and quantum environments. The result shows that the key generated in the classical hardware is limited to 64-bit as envisaged; the quantum key is generated found to be complex as the instruction set changes from classical instruction set to quantum instruction set. Further, the additional factor of randomness in quantum computing increases the security of the cipher text, which is transmitted over the internet, showing insights for practical applications.
The growing threat of quantum computing to classical cryptographic systems such as RSA and ECC has led to an urgent need for post-quantum cryptographic (PQC) research and implementation. The base paper, “Quantum Computing in Cryptography”, identified a major research gap - the lack of practical implementation of post-quantum algorithms, emphasizing that most existing works remain at a theoretical level. Addressing this gap, we develop and execute a practical benchmarking framework that compares classical RSA and simulated post-quantum cryptographic algorithms. The implementation integrates automatic setup, execution, and visualization of key generation, encryption, and decryption operations for both classical and PQC schemes. Experimental results demonstrate that while RSA achieves faster computational performance, it becomes vulnerable to quantum computational attacks. Conversely, post-quantum algorithms, though more computationally demanding, exhibit strong resistance against such attacks. The performance analysis highlights the trade-off between speed and quantum resilience, confirming the practical viability of PQC for future-proof cryptographic systems. This work effectively bridges the theoretical–practical divide noted in the base paper by providing a concrete, implementable model for evaluating post-quantum cryptography under realistic computational conditions.
The classical encryption systems are shrouded in darkness with the so-rapid development of the methods of computing and the innovation of quantum computer. Classical cryptographic protocols such as RSA, AES and ECC have been on the data security programs over years and their resistance against any classical attack is well known. Nonetheless, these new algorithms are getting more threatened when quantum threats exist which can take advantage of the mathematical structures on which traditional cryptography has been developed. We provide an in-depth comparison of the classical vs post-quantum encryption algorithms speed, computation difficulty, scalability and degree to which they are susceptible to quantum attacks. The summary also encompasses both post-quantum, lattice breaking procedures and assaults to code-based and hash-based cryptographic structures. The experimental results and theoretical analysis both demonstrate the trade-off of security strength, key size, implicit execution complexity of both paradigms. These results can be used to inform the construction of highly sought after hybrid cryptographic protocols that guarantee data confidentiality along with integrity when classical and quantum machines are present.
As the advent of quantum computing looms, the cryptographic landscape faces unprecedented challenges that could render traditional algorithms like AES, RSA, and ECC vulnerable. This paper delves into a comparative study of these classical cryptographic algorithms, examining their foundational principles and evaluating their resilience against quantum computing threats, particularly Shor’s and Grover’s algorithms. Through a combination of theoretical analysis and practical simulations, we assess the potential weaknesses and strengths of AES, RSA, and ECC in the post-quantum era. The study highlights the need for quantum-resistant cryptographic methods and explores how current algorithms can be adapted or replaced to withstand the sophisticated computational capabilities of quantum computers. By bridging the gap between classical and quantum cryptography, this research offers crucial insights into the future of secure digital communication, underscoring the urgency for innovation in cryptographic practices to safeguard data in an increasingly quantum-dominated world.
Quantum computing is a transformational technology once implemented, capable of addressing problems far beyond the capacity of classical computers. But this progress is also a real challenge to the core of today's modern security. Traditional cryptographic algorithms, such as those based on RSA, ECC, and Diffie-Hellman key exchange, are based on the computational hardness of problems such as prime factorization and discrete logarithms that quantum algorithms solve in polynomial time. As a particular research interesting example, with Shor's Algorithm one can factorize large numbers efficiently, rendering insecure the majority of public key cryptosystems used nowadays. This urgently demands a reevaluation of existing encryption schemes in the context of a post-quantum world. In this paper, we take a closer look at the threats that quantum computers pose to classical security infrastructure including encryption scheme and explore the impact that quantum computation can have on current cryptographic schemes. It calculates the cost in terms of symmetric and asymmetric security, accounting for effects of both Shor's and Grover's algorithms. Symmetric key systems such as AES are also harder hit—Grover's algorithm can give only a quadratic speedup here—but they do need to double key sizes for a sufficient level of post-quantum security. In reaction to those threats, the paper investigates nextgeneration post-quantum cryptographic (PQC) solutions resistant to quantum cryptanalysis. Lattice-based cryptosystems, hash-based signature schemes, multivariate polynomial systems, and code-based cryptosystems are some of the candidates that are being considered in international standardization work, including especially at NIST. In this paper, we compare those alternatives for security, performance, scalability, and feasibility of implementation in real system. An important aspect of this contribution is a comparative study of traditional and post-quantum cryptographic protocols in the context of a number of cybersecurity applications, including secure communications, blockchain networks and IoT contexts. It also covers the quantum readiness timeline and transitional issues, such as backward compatibility, standardization lag and the associated increased computational overhead. Through a mitigated risk evaluation and cryptanalytic attack simulation based on quantum-inspired algorithms, this analysis emphasizes the need to prepare ourselves against quantum-induced security issues. It provides strategic guidance to organizations as they plan for the post-quantum future, stressing cryptographic agility, hybrid encryption models and real-time threat monitoring. Ultimately, the results of this work add to the worldwide conversation on establishing secure systems within the digital age of quantum computing and recommend proactive migration plans for the integrity, confidentiality, and trust one should have in the future cyber world.
The advent of quantum computing ushers in a new era of computational capability and challenges the fundamental principles of modern cryptography. 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.