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 Conference on Smart Systems for Applications in Electrical Sciences (ICSSES)

Post Quantum Implications on Private and Public Key Cryptography

Seema B. Hegde, Aayush Jamuar, Raghunath Kulkarni

Published Jul 7, 2023• 13 citations
Publisher

Abstract

With the increase in the computing resources power the quantum computers are penetrating into the communication networks. Therefore, assured security of classical cryptographic algorithms is highly questionable and needs inspection. Hence, this paper aims to explore the implications of quantum computing on contemporary cryptography and briefs key post-quantum algorithms. The reader will delve into various topics including current cryptographic schemes (both symmetric and asymmet-ric), the disparities between quantum and classical computing, key quantum algorithms such as Shor's and Grover's, the impact on public key encryption schemes, affected symmetric schemes, and the field of post-quantum cryptography. Specifically, the section on Post-Quantum Cryptography covers diverse quantum key distribution methods and mathematical based solutions, such as the BB84 protocol, lattice-based cryptography, multivariate-based cryptography, hash-based signatures, and code-based cryp-tography.

DOI
10.1109/icsses58299.2023.10199503

Related papers

The Impact of Quantum Computing on Present Cryptography

Vasileios Mavroeidis, Kamer Vishi, D. Mateusz +1 more

The aim of this paper is to elucidate the implications of quantum computing in present cryptography and to introduce the reader to basic post-quantum algorithms. In particular the reader can delve into the following subjects: present cryptographic schemes (symmetric and asymmetric), differences between quantum and classical computing, challenges in quantum computing, quantum algorithms (Shor’s and Grover’s), public key encryption schemes affected, symmetric schemes affected, the impact on hash functions, and post quantum cryptography. Specifically, the section of Post-Quantum Cryptography deals with different quantum key distribution methods and mathematicalbased solutions, such as the BB84 protocol, lattice-based cryptography, multivariate-based cryptography, hash-based signatures and code-based cryptography.

arXiv:1804.00200•International Journal of Advanced Computer Science and Applications•Jan 1, 2018•475 citations

Post-Quantum Cryptography: Preparing for the Quantum Computing Era

Dr. Raj Kumar Garg

Abstract It is viewed as revolutionary technology, offering incredible potential in terms of computing power within different scientific and industrial sectors. Quantum computers provide remarkable computing power; however, they also present significant security risks to existing public-key cryptography systems used to secure digital communication, online banking systems, government, medical applications, cloud computing systems, and IoT systems. Security of commonly used encryption schemes like RSA, DH, and ECC depends on mathematical problems that are impossible for classical computers to solve but can be easily resolved with the help of powerful enough quantum computers by using Shor’s algorithm. Furthermore, Grover’s algorithm makes exhaustive search attacks much faster, thus effectively lowering the security level of symmetric encryption schemes since it provides the speed-up for brute-force attacks. Post-Quantum Cryptography (PQC) turned out to be an effective and scalable method to protect digital data from attacks using quantum computing. In contrast to quantum cryptography, which requires a special quantum communication channel, PQC uses classical cryptographic algorithms that cannot be broken down by either classical or quantum computer due to certain mathematical problems. This research paper offers an extensive exploration of post-quantum cryptography through the analysis of the development of quantum computing, weaknesses of current cryptographic techniques, and mathematics behind quantum-resistant algorithms. Moreover, this paper explores the major classes of PQC techniques such as lattice-based, code-based, hash-based, multivariate, and isogeny-based cryptography and provides details about their security and application. Moreover, the report gives an overview of the NIST Post-Quantum Cryptography Standardization Project and analyzes recent standardizations of quantum-proof algorithms to be utilized in future digital infrastructures. Keywords: Post-Quantum Encryption, Quantum Security, Quantum-Proof Public-Key Cryptography, Lattice-Based Security Protocols, ML-KEM Key Encapsulation Mechanism, ML-DSA Digital Signature Algorithm, NIST Post-Quantum Cryptography, Contemporary Cybersecurity, Secure Communications, Cryptographic Algorithms.

•Aug 12, 2026•0 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

Quantum Computing and Cryptography: Security Challenges and Post-Quantum Solutions

Alok Priyadarshi, Raushan Kumar, Kumar Soumya +2 more

Quantum computing is rapidly emerging as a trans-formative technology with the potential to solve certain computational problems much faster than classical computers. While this advancement offers significant opportunities in science and technology, it also raises serious concerns for modern crypto-graphic systems. Widely used encryption methods such as RSA and Elliptic Curve Cryptography (ECC) rely on mathematical problems that are difficult for classical computers to solve but may become vulnerable to powerful quantum algorithms such as Shor’s and Grover’s algorithms. This paper examines the impact of quantum computing on existing cryptographic techniques and discusses the need for quantum-resistant security solutions. Various post-quantum cryptographic approaches, including lattice-based, hash-based, code-based, and multivariate cryptographic systems, are reviewed and compared in terms of security, performance, and practical implementation. The study also explores the strengths and limitations of these approaches and evaluates their suitability for future digital security requirements. In addition, the paper highlights the importance of hybrid cryptographic systems that combine classical and post-quantum methods. Such systems can support a gradual transition to quantum-resistant security while maintaining compatibility with existing infrastructure. Although post-quantum cryptography offers promising protection against future quantum threats, challenges such as increased computational requirements, larger key sizes, and implementation complexity remain important considerations. The findings emphasize the need for continued research, standardization, and strategic planning to ensure a secure transition to the post-quantum era. As quantum computing technology continues to advance, the adoption of reliable quantum-resistant cryptographic solutions will be essential for protecting digital communications, sensitive information, and critical infrastructure.

International Conference on Secure Information Systems and Technologies (ICSIST)•Aug 1, 2026•0 citations

Review Paper on Quantum Computing and Quantum Cryptography

Brijraj Singh Solanki, Apurva Saini, Apurva Saini

Quantum computing and quantum cryptography are two areas of research that have the potential to transform modern computing and communication. Quantum computing promises to solve computational problems that are beyond the reach of classical computers, while quantum cryptography provides a way to secure communication channels that is immune to eavesdropping. Quantum cryptography is one of the emerging topics in the field of computer industry. This article focuses on quantum cryptography and how this technology makes a valuable contribution to an intensive defense strategy of completely secure key distribution. The scope of this article covers the weaknesses of modern digital cryptographic systems, the basic concepts of quantum cryptography, the practical implementations of this technology, and its limitations. , and finally the future direction that quantum cryptography is headed. We describe the result of an apparatus and protocol designed to perform quantum key distribution, whereby two users do not share any secret information (no private or public keys are known). previously known) initially exchanges a random quantum transmission consisting of veryweakly polarized light rays. In particular, readers can explore the following topics in depth: current cryptographic schemes (symmetric and asymmetric), the difference between quantum and classical computing, challenges of quantum computing, quantum algorithms (Shor and Grover), public key cryptographic schemes affected, symmetry affected schemes, impact on hash functions and post-quantum cryptography

International Journal of Advanced Research in Science Communication and Technology•May 29, 2023•1 citation

Post-Quantum Cryptography for Secure Communication: A Systematic Review of Algorithms, Performance Trade-offs, and Emerging Challenges

Suvhodip Saha

The rapid growth of quantum computing poses a critical threat to classical cryptographic systems. That is due in large part to the fact that they represent efficient solutions for some of the most challenging mathematical problems such as integer factoring or finding discrete logarithms. Schemes currently in wide use including RSA, Diffie–Hellman, and elliptic curve cryptography are particularly susceptible to being attacked by quantum computers, using algorithms like Shor's Algorithm and Grover's Algorithm. The advent of post-quantum cryptography (PQC) provides a promising potential answer to providing longterm security from adversaries using quantum computing capabilities. This paper presents a comprehensive state-of-the-art review of various PQC techniques currently being researched, including lattice-based methods, code-based methods, multivariate methods, hash-based methods, and isogeny-based methods. key challenges that will need to be addressed include computational overhead, large key sizes and implementation complexity. Furthermore the study reviews the current standardization efforts by the National Institute of Standards and Technology related to PQC and discusses some of the very specific practical considerations that need to be considered before widely deploying these techniques. The paper concludes by a complete list of existing research challenges and proposed future work that will assist in the development of efficient and scalable systems that will resist attacks from quantum computers.

International Journal for Research in Applied Science and Engineering Technology•Mar 24, 2026•0 citations
With the increase in the computing resources power the quantum computers are penetrating into the communication networks. Therefore, assured security of classical cryptographic algorithms is highly questionable and needs inspection. Hence, this paper aims to explore the implications of quantum computing on contemporary cryptography and briefs key post-quantum algorithms. The reader will delve into various topics including current cryptographic schemes (both symmetric and asymmet-ric), the disparities between quantum and classical computing, key quantum algorithms such as Shor's and Grover's, the impact on public key encryption schemes, affected symmetric schemes, and the field of post-quantum cryptography. Specifically, the section on Post-Quantum Cryptography covers diverse quantum key distribution methods and mathematical based solutions, such as the BB84 protocol, lattice-based cryptography, multivariate-based cryptography, hash-based signatures, and code-based cryp-tography.
The aim of this paper is to elucidate the implications of quantum computing in present cryptography and to introduce the reader to basic post-quantum algorithms. In particular the reader can delve into the following subjects: present cryptographic schemes (symmetric and asymmetric), differences between quantum and classical computing, challenges in quantum computing, quantum algorithms (Shor’s and Grover’s), public key encryption schemes affected, symmetric schemes affected, the impact on hash functions, and post quantum cryptography. Specifically, the section of Post-Quantum Cryptography deals with different quantum key distribution methods and mathematicalbased solutions, such as the BB84 protocol, lattice-based cryptography, multivariate-based cryptography, hash-based signatures and code-based cryptography.
Abstract It is viewed as revolutionary technology, offering incredible potential in terms of computing power within different scientific and industrial sectors. Quantum computers provide remarkable computing power; however, they also present significant security risks to existing public-key cryptography systems used to secure digital communication, online banking systems, government, medical applications, cloud computing systems, and IoT systems. Security of commonly used encryption schemes like RSA, DH, and ECC depends on mathematical problems that are impossible for classical computers to solve but can be easily resolved with the help of powerful enough quantum computers by using Shor’s algorithm. Furthermore, Grover’s algorithm makes exhaustive search attacks much faster, thus effectively lowering the security level of symmetric encryption schemes since it provides the speed-up for brute-force attacks. Post-Quantum Cryptography (PQC) turned out to be an effective and scalable method to protect digital data from attacks using quantum computing. In contrast to quantum cryptography, which requires a special quantum communication channel, PQC uses classical cryptographic algorithms that cannot be broken down by either classical or quantum computer due to certain mathematical problems. This research paper offers an extensive exploration of post-quantum cryptography through the analysis of the development of quantum computing, weaknesses of current cryptographic techniques, and mathematics behind quantum-resistant algorithms. Moreover, this paper explores the major classes of PQC techniques such as lattice-based, code-based, hash-based, multivariate, and isogeny-based cryptography and provides details about their security and application. Moreover, the report gives an overview of the NIST Post-Quantum Cryptography Standardization Project and analyzes recent standardizations of quantum-proof algorithms to be utilized in future digital infrastructures. Keywords: Post-Quantum Encryption, Quantum Security, Quantum-Proof Public-Key Cryptography, Lattice-Based Security Protocols, ML-KEM Key Encapsulation Mechanism, ML-DSA Digital Signature Algorithm, NIST Post-Quantum Cryptography, Contemporary Cybersecurity, Secure Communications, Cryptographic Algorithms.
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.
Quantum computing is rapidly emerging as a trans-formative technology with the potential to solve certain computational problems much faster than classical computers. While this advancement offers significant opportunities in science and technology, it also raises serious concerns for modern crypto-graphic systems. Widely used encryption methods such as RSA and Elliptic Curve Cryptography (ECC) rely on mathematical problems that are difficult for classical computers to solve but may become vulnerable to powerful quantum algorithms such as Shor’s and Grover’s algorithms. This paper examines the impact of quantum computing on existing cryptographic techniques and discusses the need for quantum-resistant security solutions. Various post-quantum cryptographic approaches, including lattice-based, hash-based, code-based, and multivariate cryptographic systems, are reviewed and compared in terms of security, performance, and practical implementation. The study also explores the strengths and limitations of these approaches and evaluates their suitability for future digital security requirements. In addition, the paper highlights the importance of hybrid cryptographic systems that combine classical and post-quantum methods. Such systems can support a gradual transition to quantum-resistant security while maintaining compatibility with existing infrastructure. Although post-quantum cryptography offers promising protection against future quantum threats, challenges such as increased computational requirements, larger key sizes, and implementation complexity remain important considerations. The findings emphasize the need for continued research, standardization, and strategic planning to ensure a secure transition to the post-quantum era. As quantum computing technology continues to advance, the adoption of reliable quantum-resistant cryptographic solutions will be essential for protecting digital communications, sensitive information, and critical infrastructure.
Quantum computing and quantum cryptography are two areas of research that have the potential to transform modern computing and communication. Quantum computing promises to solve computational problems that are beyond the reach of classical computers, while quantum cryptography provides a way to secure communication channels that is immune to eavesdropping. Quantum cryptography is one of the emerging topics in the field of computer industry. This article focuses on quantum cryptography and how this technology makes a valuable contribution to an intensive defense strategy of completely secure key distribution. The scope of this article covers the weaknesses of modern digital cryptographic systems, the basic concepts of quantum cryptography, the practical implementations of this technology, and its limitations. , and finally the future direction that quantum cryptography is headed. We describe the result of an apparatus and protocol designed to perform quantum key distribution, whereby two users do not share any secret information (no private or public keys are known). previously known) initially exchanges a random quantum transmission consisting of veryweakly polarized light rays. In particular, readers can explore the following topics in depth: current cryptographic schemes (symmetric and asymmetric), the difference between quantum and classical computing, challenges of quantum computing, quantum algorithms (Shor and Grover), public key cryptographic schemes affected, symmetry affected schemes, impact on hash functions and post-quantum cryptography
The rapid growth of quantum computing poses a critical threat to classical cryptographic systems. That is due in large part to the fact that they represent efficient solutions for some of the most challenging mathematical problems such as integer factoring or finding discrete logarithms. Schemes currently in wide use including RSA, Diffie–Hellman, and elliptic curve cryptography are particularly susceptible to being attacked by quantum computers, using algorithms like Shor's Algorithm and Grover's Algorithm. The advent of post-quantum cryptography (PQC) provides a promising potential answer to providing longterm security from adversaries using quantum computing capabilities. This paper presents a comprehensive state-of-the-art review of various PQC techniques currently being researched, including lattice-based methods, code-based methods, multivariate methods, hash-based methods, and isogeny-based methods. key challenges that will need to be addressed include computational overhead, large key sizes and implementation complexity. Furthermore the study reviews the current standardization efforts by the National Institute of Standards and Technology related to PQC and discusses some of the very specific practical considerations that need to be considered before widely deploying these techniques. The paper concludes by a complete list of existing research challenges and proposed future work that will assist in the development of efficient and scalable systems that will resist attacks from quantum computers.