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

Communications in computer and information science

Lattice-Based Encryption in Building Post Quantum-Resistant Algorithms for Next-Generation Security

Rubayat Islam Khan, Saif Shahriar Rahman Nirzhor, Tiffany Khou, Don Roosan

Published Jan 1, 2026• 4 citations
Publisher
DOI
10.1007/978-3-032-22211-4_15

Related papers

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

A Lattice-Based Hybrid Encryption Framework for Post-Quantum Security

Revathy M, D D, Natarajan K

International Conference on Secure Cyber Computing and Communications (ICSCCC)•May 29, 2026•0 citations

Advances in Lattice-Based Cryptography for Post-Quantum Security: Protocols, Benchmarks, and Applications

G. Sunil, B. Girirajan, Manda Sai Anjani

Lecture notes in networks and systems•Jun 29, 2026•0 citations

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

M. A. Burhanuddin

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.

Khwarizmia.•Jul 25, 2023•15 citations

Reengineering encryption via mathematical lattice constructs for quantum threat mitigation

Fangfang Zhang, Yongqi Zheng

International Journal of Information and Communication Technology•Jan 1, 2026•0 citations

Quantum-Resistant Cryptographic Algorithms: A Comparative Analysis for Securing Next-Generation Communication Networks

Sagar Ramesh Rane

The advent of quantum computing poses a significant challenge to conventional cryptographic methods such as RSA, Elliptic Curve Cryptography (ECC), and Diffie-Hellman key exchange. Quantum algorithms, particularly Shor’s algorithm, have the potential to break these encryption techniques, making it essential to develop cryptographic approaches that can withstand quantum threats. Post-quantum cryptography (PQC) has emerged as a crucial area of research, aiming to establish cryptographic mechanisms that remain secure even in the presence of quantum adversaries. This study presents a detailed comparative analysis of five primary categories of quantum-resistant cryptographic algorithms: lattice-based, code-based, hash-based, multivariate polynomial, and isogeny-based encryption schemes. Each of these approaches offers distinct advantages and challenges in terms of security, efficiency, and implementation feasibility. Among them, lattice-based cryptography has gained significant attention due to its robust security properties and computational efficiency, making it a strong candidate for standardization. Conversely, code-based cryptography provides high security but is hindered by its large key sizes, affecting its practical deployment. The research includes a real-time performance assessment of selected PQC algorithms, analyzing key factors such as encryption speed, key size, and computational demands. Furthermore, the study examines the challenges associated with transitioning from classical encryption standards to quantum-resistant frameworks, including compatibility constraints, computational overhead, and the necessity for global standardization. Potential mitigation approaches, such as hybrid cryptographic techniques that integrate both classical and post-quantum encryption models, are also explored. Our findings emphasize that while quantum-resistant cryptography is still evolving, early adoption of PQC frameworks is essential for safeguarding future communication networks. This paper provides valuable insights for researchers, cybersecurity professionals, and policymakers on strategic measures to implement quantum-secure encryption systems effectively.

Journal of Information Systems Engineering & Management•Feb 10, 2025•0 citations
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 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 advent of quantum computing poses a significant challenge to conventional cryptographic methods such as RSA, Elliptic Curve Cryptography (ECC), and Diffie-Hellman key exchange. Quantum algorithms, particularly Shor’s algorithm, have the potential to break these encryption techniques, making it essential to develop cryptographic approaches that can withstand quantum threats. Post-quantum cryptography (PQC) has emerged as a crucial area of research, aiming to establish cryptographic mechanisms that remain secure even in the presence of quantum adversaries. This study presents a detailed comparative analysis of five primary categories of quantum-resistant cryptographic algorithms: lattice-based, code-based, hash-based, multivariate polynomial, and isogeny-based encryption schemes. Each of these approaches offers distinct advantages and challenges in terms of security, efficiency, and implementation feasibility. Among them, lattice-based cryptography has gained significant attention due to its robust security properties and computational efficiency, making it a strong candidate for standardization. Conversely, code-based cryptography provides high security but is hindered by its large key sizes, affecting its practical deployment. The research includes a real-time performance assessment of selected PQC algorithms, analyzing key factors such as encryption speed, key size, and computational demands. Furthermore, the study examines the challenges associated with transitioning from classical encryption standards to quantum-resistant frameworks, including compatibility constraints, computational overhead, and the necessity for global standardization. Potential mitigation approaches, such as hybrid cryptographic techniques that integrate both classical and post-quantum encryption models, are also explored. Our findings emphasize that while quantum-resistant cryptography is still evolving, early adoption of PQC frameworks is essential for safeguarding future communication networks. This paper provides valuable insights for researchers, cybersecurity professionals, and policymakers on strategic measures to implement quantum-secure encryption systems effectively.