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

Khwarizmia.

Secure and Scalable Quantum Cryptographic Algorithms for Next-Generation Computer Networks

M. A. Burhanuddin

Published Jul 25, 2023• 15 citations
Publisher

Abstract

The rise of quantum computing poses a serious threat to traditional cryptosystems, such as RSA and ECC, which rely on the mathematical problem of factoring large numbers and dealing with discrete logarithms Quantum algorithms such as Shor and Grover can solve solve these problems effectively, so that classical The encryption is simple. This research addresses the urgent need for quantum-resistant cryptographic algorithms to protect next-generation networks, including 5G, IoT, and cloud computing, from future quantum attacks. The main objective of this study is to investigate the efficiency and scalability of quantum post-cryptography techniques, especially lattice-based cryptography, and to evaluate their performance in comparison with traditional cryptography and other post-quantum techniques. It also provides robust protection against quantum attacks and reasonable scalability to large networks, while delivering large key size requirements, low connectivity and excess capacity. The study concludes that lattice-based cryptography is an appropriate solution that balances quantum resistance with practical performance in real-world applications to ensure secure communications in the post-quantum era.

DOI
10.70470/khwarizmia/2023/009

Related papers

Post-Quantum Cryptography for Next-Generation Communication Networks

Daniyal Zaheer

The potential of the swift development of quantum computing is an extreme danger to the traditional cryptographic programs, and they are the foundation of the modern communication infrastructure. RSA and ECC are classical public-key algorithms that can be successfully quantum-attacked, in particular, Shor's algorithm can easily factor large integers and calculate discrete logarithms (Bernstein et al., 2017). The Post-Quantum Cryptography (PQC) has become the key to secure the next-generation communication networks against these threats, which relies on lattice problem-based algorithms, hash-based based algorithms, multivariate polynomials-based algorithms, and code-based cryptography. The paper examines the concepts, design, and implementation issues of PQC within current network infrastructure focusing on the secure transmission of data, authentication, and key management in the upcoming 5G and 6G networks. The approach will include the survey of existing algorithms of PQC, model the integration of protocol in the communication systems and test computational efficiency, security strength, and scalability. It has been found that PQC is suitable to protect network communications against quantum attackers, and achieves reasonable performance, though trade-offs can be seen in terms of computation overhead, key size, and latency. The research offers understanding to the researcher, network engineers and policy makers in order to adopt quantum resistant cryptography protocols to secure the confidentiality, integrity and authenticity of information in the future communication networks.

ACADEMIA Tech Frontiers Journal•Aug 11, 2025•0 citations

Quantum-Resistant Cryptographic Protocols for Post-Quantum Secure Communications

Padma Guntupalli, M. Chandana, M. Rashi +3 more

The development of quantum computing poses a very real threat to traditional cryptography, especially these, which are number-theoretic like RSA and ECC. With the more and more development of quantum algorithms such as Shor and Grover, there is an immediate necessity to come up with cryptographic protocols that are resistant to quantum attacks. This paper reviews and discusses different quantum-resistant (post-quantum) cryptographic schemes, such as lattice-based, code-based, multivariate, hash-based, and isogeny-based cryptography. It compares these protocols on the assumptions of their security and their efficiency in their computation and the size of their keys as well as their possible integrations into the existing communication infrastructure. Moreover, we also evaluate the standardization process by NIST and the difficulties of moving towards post-quantum security in practical use. This paper proposes a scalable comparison system, which correlates the hypothetical security basis of postquantum cryptography with the ability to effectively operate in the real world. It has emphasized protocol interoperability, migration compatibility and trade-offs in performance that gives a viable roadmap towards quantum-resistant cryptographic protocols implementation into current communication infrastructures whilst also providing scalable and future secure communication systems. This study, by emphasizing the potential and the drawbacks of the existing post-quantum cryptography schemes, helps in a more precise idea of the directions to follow on the way to a secure, future-proof communications scheme.

International Conference on Computing for Sustainable Global Development•Apr 8, 2026•0 citations

Post-quantum investigating Cryptography for Data Safeguard Transmission in Future Network Communication

Laith H. Jasim Alzubaidi, M. Sivabharathy, V. Venkataiah +3 more

With the fast-paced development of quantum computing, classical cryptographic techniques are under severe security threats, prompting the need for post-quantum cryptographic mechanisms for secure data exchange in next-generation network communications. Post-quantum cryptography seeks to protect sensitive data against quantum attacks to provide long-term data confidentiality. But all current cryptographic techniques, including RSA and ECC, are susceptible to quantum algorithms like Shor's algorithm, which can factor large integers efficiently and break discrete logarithm problems, making classical cryptography useless. There is thus a pressing need for quantum attack-resistant encryption mechanisms. To meet these challenges, we introduce the Lattice-Based Cryptography with Hybrid Key Exchange (L-CHKE) framework, which combines lattice-based encryption with a hybrid key exchange mechanism. Lattice-based cryptography provides quantum resistance because it is based on hard mathematical problems such as Learning with Errors (LWE), which provides greater security and efficiency. The designed L-CHKE algorithm strengthens secure key distribution and authentication for next-generation networks, especially for applications needing strong security like financial transactions, IoT, and military communications. Experimental results verify that L-CHKE noticeably boosts computational efficiency by 98.45%, decreases key exchange latency by 42.56%, and guarantees robustness by 97.64% against quantum attacks, indicating it is an appropriate solution for post-quantum secure communication.

International Conference on Computational Innovations and Engineering Sustainability (ICCIES)•Apr 24, 2025•0 citations

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

Quantum-Resistant Cryptographic Protocols for Post-Quantum Secure Communications

G. Shiva Parvathi, P. Akhila, T. Harshitha +3 more

The development of quantum computing poses a very real threat to traditional cryptography, especially these, which are number-theoretic like RSA and ECC.With the more and more development of quantum algorithms such as Shor and Grover, there is an immediate necessity to come up with cryptographic protocols that are resistant to quantum attacks.This paper reviews and discusses different quantum-resistant (post-quantum) cryptographic schemes, such as latticebased, code-based, multivariate, hash-based, and isogeny-based cryptography.It compares these protocols on the assumptions of their security and their efficiency in their computation and the size of their keys as well as their possible integrations into the existing communication infrastructure.Moreover, we also evaluate the standardization process by NIST and the difficulties of moving towards post-quantum security in practical use.This paper proposes a scalable comparison system, which correlates the hypothetical security basis of post-quantum cryptography with the ability to effectively operate in the real world.It has emphasized protocol interoperability, migration compatibility and trade-offs in performance that gives a viable roadmap towards quantum-resistant cryptographic protocols implementation into current communication infrastructures whilst also providing scalable and future secure communication systems.This study, by emphasizing the potential and the drawbacks of the existing post-quantum cryptography schemes, helps in a more precise idea of the directions to follow on the way to a secure, future-proof communications scheme.

International Journal of Research in Advent Technology•Jun 30, 2026•0 citations

Post-Quantum Cryptographic Algorithms for Secure Communication in Decentralized Blockchain and Cloud Infrastructure

The advent of quantum computing poses an existential threat to contemporary cryptographic standards, particularly those securing decentralized blockchain networks and cloud infrastructures.Classical public-key cryptosystems such as RSA, ECC, and DH, which rely on factorization and discrete logarithm problems, are rendered obsolete by Shor's algorithm, necessitating the transition toward post-quantum cryptographic (PQC) solutions.This study explores the integration of PQC algorithms, including lattice-based, hash-based, code-based, multivariate, and isogeny-based cryptographic mechanisms, within blockchain-ledger technologies and cloud architectures to ensure long-term security against quantum adversaries.A comparative analysis is conducted to evaluate computational efficiency, key size implications, communication overhead, and security resilience under quantum attack models.The research highlights the adaptation of PQC within blockchain consensus mechanisms, smart contract execution, and cryptographic primitives such as digital signatures, zero-knowledge proofs, and secure multi-party computation (MPC).Additionally, it examines the impact of PQC on cloud security, addressing challenges in quantum-safe key exchange protocols, homomorphic encryption for secure computations, and cross-platform interoperability within hybrid quantum-classical cloud ecosystems.Real-world implementations and benchmarking data provide insights into the feasibility of large-scale adoption, shedding light on standardization efforts by NIST and industry consortia.The study concludes with future directions, emphasizing the need for efficient PQC algorithm optimization, lightweight cryptographic frameworks for IoT-driven blockchain applications, and scalable post-quantum identity management systems.By establishing quantum-resistant security frameworks, this research underscores the imperative need for early adoption to mitigate cryptographic vulnerabilities in the impending post-quantum era.

International Journal of Computer Applications Technology and Research•Feb 13, 2025•6 citations
The rise of quantum computing poses a serious threat to traditional cryptosystems, such as RSA and ECC, which rely on the mathematical problem of factoring large numbers and dealing with discrete logarithms Quantum algorithms such as Shor and Grover can solve solve these problems effectively, so that classical The encryption is simple. This research addresses the urgent need for quantum-resistant cryptographic algorithms to protect next-generation networks, including 5G, IoT, and cloud computing, from future quantum attacks. The main objective of this study is to investigate the efficiency and scalability of quantum post-cryptography techniques, especially lattice-based cryptography, and to evaluate their performance in comparison with traditional cryptography and other post-quantum techniques. It also provides robust protection against quantum attacks and reasonable scalability to large networks, while delivering large key size requirements, low connectivity and excess capacity. The study concludes that lattice-based cryptography is an appropriate solution that balances quantum resistance with practical performance in real-world applications to ensure secure communications in the post-quantum era.
The potential of the swift development of quantum computing is an extreme danger to the traditional cryptographic programs, and they are the foundation of the modern communication infrastructure. RSA and ECC are classical public-key algorithms that can be successfully quantum-attacked, in particular, Shor's algorithm can easily factor large integers and calculate discrete logarithms (Bernstein et al., 2017). The Post-Quantum Cryptography (PQC) has become the key to secure the next-generation communication networks against these threats, which relies on lattice problem-based algorithms, hash-based based algorithms, multivariate polynomials-based algorithms, and code-based cryptography. The paper examines the concepts, design, and implementation issues of PQC within current network infrastructure focusing on the secure transmission of data, authentication, and key management in the upcoming 5G and 6G networks. The approach will include the survey of existing algorithms of PQC, model the integration of protocol in the communication systems and test computational efficiency, security strength, and scalability. It has been found that PQC is suitable to protect network communications against quantum attackers, and achieves reasonable performance, though trade-offs can be seen in terms of computation overhead, key size, and latency. The research offers understanding to the researcher, network engineers and policy makers in order to adopt quantum resistant cryptography protocols to secure the confidentiality, integrity and authenticity of information in the future communication networks.
The development of quantum computing poses a very real threat to traditional cryptography, especially these, which are number-theoretic like RSA and ECC. With the more and more development of quantum algorithms such as Shor and Grover, there is an immediate necessity to come up with cryptographic protocols that are resistant to quantum attacks. This paper reviews and discusses different quantum-resistant (post-quantum) cryptographic schemes, such as lattice-based, code-based, multivariate, hash-based, and isogeny-based cryptography. It compares these protocols on the assumptions of their security and their efficiency in their computation and the size of their keys as well as their possible integrations into the existing communication infrastructure. Moreover, we also evaluate the standardization process by NIST and the difficulties of moving towards post-quantum security in practical use. This paper proposes a scalable comparison system, which correlates the hypothetical security basis of postquantum cryptography with the ability to effectively operate in the real world. It has emphasized protocol interoperability, migration compatibility and trade-offs in performance that gives a viable roadmap towards quantum-resistant cryptographic protocols implementation into current communication infrastructures whilst also providing scalable and future secure communication systems. This study, by emphasizing the potential and the drawbacks of the existing post-quantum cryptography schemes, helps in a more precise idea of the directions to follow on the way to a secure, future-proof communications scheme.
With the fast-paced development of quantum computing, classical cryptographic techniques are under severe security threats, prompting the need for post-quantum cryptographic mechanisms for secure data exchange in next-generation network communications. Post-quantum cryptography seeks to protect sensitive data against quantum attacks to provide long-term data confidentiality. But all current cryptographic techniques, including RSA and ECC, are susceptible to quantum algorithms like Shor's algorithm, which can factor large integers efficiently and break discrete logarithm problems, making classical cryptography useless. There is thus a pressing need for quantum attack-resistant encryption mechanisms. To meet these challenges, we introduce the Lattice-Based Cryptography with Hybrid Key Exchange (L-CHKE) framework, which combines lattice-based encryption with a hybrid key exchange mechanism. Lattice-based cryptography provides quantum resistance because it is based on hard mathematical problems such as Learning with Errors (LWE), which provides greater security and efficiency. The designed L-CHKE algorithm strengthens secure key distribution and authentication for next-generation networks, especially for applications needing strong security like financial transactions, IoT, and military communications. Experimental results verify that L-CHKE noticeably boosts computational efficiency by 98.45%, decreases key exchange latency by 42.56%, and guarantees robustness by 97.64% against quantum attacks, indicating it is an appropriate solution for post-quantum secure communication.
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.
The development of quantum computing poses a very real threat to traditional cryptography, especially these, which are number-theoretic like RSA and ECC.With the more and more development of quantum algorithms such as Shor and Grover, there is an immediate necessity to come up with cryptographic protocols that are resistant to quantum attacks.This paper reviews and discusses different quantum-resistant (post-quantum) cryptographic schemes, such as latticebased, code-based, multivariate, hash-based, and isogeny-based cryptography.It compares these protocols on the assumptions of their security and their efficiency in their computation and the size of their keys as well as their possible integrations into the existing communication infrastructure.Moreover, we also evaluate the standardization process by NIST and the difficulties of moving towards post-quantum security in practical use.This paper proposes a scalable comparison system, which correlates the hypothetical security basis of post-quantum cryptography with the ability to effectively operate in the real world.It has emphasized protocol interoperability, migration compatibility and trade-offs in performance that gives a viable roadmap towards quantum-resistant cryptographic protocols implementation into current communication infrastructures whilst also providing scalable and future secure communication systems.This study, by emphasizing the potential and the drawbacks of the existing post-quantum cryptography schemes, helps in a more precise idea of the directions to follow on the way to a secure, future-proof communications scheme.
The advent of quantum computing poses an existential threat to contemporary cryptographic standards, particularly those securing decentralized blockchain networks and cloud infrastructures.Classical public-key cryptosystems such as RSA, ECC, and DH, which rely on factorization and discrete logarithm problems, are rendered obsolete by Shor's algorithm, necessitating the transition toward post-quantum cryptographic (PQC) solutions.This study explores the integration of PQC algorithms, including lattice-based, hash-based, code-based, multivariate, and isogeny-based cryptographic mechanisms, within blockchain-ledger technologies and cloud architectures to ensure long-term security against quantum adversaries.A comparative analysis is conducted to evaluate computational efficiency, key size implications, communication overhead, and security resilience under quantum attack models.The research highlights the adaptation of PQC within blockchain consensus mechanisms, smart contract execution, and cryptographic primitives such as digital signatures, zero-knowledge proofs, and secure multi-party computation (MPC).Additionally, it examines the impact of PQC on cloud security, addressing challenges in quantum-safe key exchange protocols, homomorphic encryption for secure computations, and cross-platform interoperability within hybrid quantum-classical cloud ecosystems.Real-world implementations and benchmarking data provide insights into the feasibility of large-scale adoption, shedding light on standardization efforts by NIST and industry consortia.The study concludes with future directions, emphasizing the need for efficient PQC algorithm optimization, lightweight cryptographic frameworks for IoT-driven blockchain applications, and scalable post-quantum identity management systems.By establishing quantum-resistant security frameworks, this research underscores the imperative need for early adoption to mitigate cryptographic vulnerabilities in the impending post-quantum era.