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

LEADING THE WAY IN QUANTUM-RESISTANT CRYPTOGRAPHY FOR EVERYDAY SAFETY

Luka Baklaga

Published Jan 1, 2024• 0 citations
Publisher

Abstract

The development of quantum-resistant solutions is imperative as the emergence of quantum computing presents a substantial risk to existing cryptography systems. Lattice-based cryptography, especially schemes based on the Learning with Errors (LWE) problem, is one of the most promising methods. To guarantee long-term security, even LWE-based methods could need to be strengthened further as quantum algorithms advance. By mixing Gaussian and discrete uniform distributions to create a mixed error distribution, this work enhances the classic LWE problem. The experimental findings show that, with a slight rise in computing overhead, the mixed error distribution improves the security of the LWE problem by strengthening its resistance to quantum techniques. By presenting a novel approach for enhancing the resilience of cryptographic methods in the quantum era, this research contributes to the continuing work in post-quantum cryptography. Moreover, it introduces the direction of future model improvements and provides multidisciplinary methods for increasing the complexity of cryptographic algorithms.

DOI
10.5281/zenodo.21532234

Related papers

A novel framework for post-quantum cryptographic schemes based on lattice-theoretic and discrete optimization techniques

Dr.Gaganjot Kaur, Mandeep Kaur, Darapu Uma +3 more

The fast development of quantum computing is a major threat to the classical cryptographic systems and the emergence of secure and efficient post-quantum cryptographic (PQC) is required.Lattice-based cryptography is one of the potential solutions that have been adopted as one of the promising solutions due to its excellent security grounds and quantum resistant nature.Nevertheless, there are difficulties of large key sizes, high computing power and flexibility to diverse application environments that plague existing lattice-based schemes.This paper introduces a new model which combines lattice-theoretic concepts and discrete optimization methods to improve the performance and scalability of PQC systems.Its methodology includes the use of optimization-based key generation, adaptive parameter choice, and using efficient encryption-decryption mechanisms that are based on the Learning With Errors (LWE) problem.Key metrics, such as key size, computation time and error rate, are used to evaluate the comprehensive performance and compared to the known schemes, such as Kyber, NTRU and Saber.Experimental evidence shows that the given model has the smaller key size of 2.4 KB, shorter calculation time of 13.9 ms and smaller error rate of 0.3 that is superior to existing techniques.The results suggest that the suggested framework offers the best compromise in terms of security, performance, and scalability, thus it is applicable to the next-generation secure communication framework in the post-quantum world.

Journal of Discrete Mathematical Sciences and Cryptography•Oct 31, 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

Learning with Errors: A Lattice-Based Keystone of Post-Quantum Cryptography

Maria E. Sabani, Ilias Κ. Savvas, Georgia Garani

The swift advancement of quantum computing devices holds the potential to create robust machines that can tackle an extensive array of issues beyond the scope of conventional computers. Consequently, quantum computing machines create new risks at a velocity and scale never seen before, especially with regard to encryption. Lattice-based cryptography is regarded as post-quantum cryptography’s future and a competitor to a quantum computer attack. Thus, there are several advantages to lattice-based cryptographic protocols, including security, effectiveness, reduced energy usage and speed. In this work, we study the learning with errors (LWE) problem and the cryptosystems that are based on the LWE problem and, in addition, we present a new efficient variant of LWE cryptographic scheme.

Signals•Apr 13, 2024•34 citations

Lattice-Based Cryptography

Seong Oun Hwang, Intae Kim, Wai‐Kong Lee

This chapter introduces post-quantum cryptography. It describes lattice-based cryptographic constructions of post-quantum cryptography. Lattice-based cryptographic constructions are one of candidates of post-quantum cryptography, which are believed to be secure against quantum computers. Learning with errors (LWE) is one of the most promising primitives in many usages due to its lightweight operation and rigorous security reduction against the worst-case of the lattice problems that are considered to be hard to solve even after the advance of quantum computers. After the research about the connection between the LWE problem and some lattice problems, some variants of LWE, of which the secret distributions are modified from the uniform distribution, were proposed. Due to the efficiency and compactness of ring-LWE, many lattice-based cryptosystems are constructed as ring-LWE based, rather than LWE-based. The chapter explains a ring variant of Lizard scheme, called RLizard, IND-CCA secure encryption scheme.

CRC Press eBooks•Feb 19, 2021•1 citation

A Secure and Quantum-Resistant Key Exchange Scheme Using FrodoKEM: A Lattice-Based Post-Quantum Approach

P Vamshi Krishna, Meeravali Shaik

The advancement of quantum computing poses a significant threat to classical cryptographic algorithms, particularly those based on factorization and discrete logarithm problems. In this paper, we propose a secure and quantum-resistant key exchange scheme leveraging the FrodoKEM algorithm, a lattice-based post-quantum key encapsulation mechanism designed to resist attacks from quantum adversaries. FrodoKEM, being based on the Learning with Errors (LWE) problem, offers a conservative and standard approach to post-quantum cryptography without relying on structured lattices. We compare the performance and security of the proposed scheme against traditional key exchange mechanisms such as RSA and Elliptic Curve Diffie-Hellman (ECDH), as well as other post-quantum algorithms like Kyber and NTRU. Our analysis demonstrates that FrodoKEM offers improved security assurances and competitive performance metrics, especially in environments where long-term confidentiality and forward secrecy are critical. The experimental results affirm FrodoKEM's suitability for real-world deployment in post-quantum secure communications.

International Journal of Computer Information Systems and Industrial Management Applications•Jul 29, 2026•0 citations

Lattice-Based Cryptography: A Post-Quantum Solution to Secure Digital Communications in the Age of Quantum Computing

Ishmeet Singh -

This paper delves into lattice-based cryptography as a cornerstone of post-quantum cryptography (PQC), exploring its evolution, key principles, and applications. It examines how lattice-based schemes leverage the inherent hardness of problems such as the Shortest Vector Problem (SVP) and Learning With Errors (LWE) to provide quantum-resistant encryption, digital signatures, and homomorphic encryption. The paper also outlines the historical development of lattice-based cryptography, emphasizing its resilience to quantum attacks in contrast to traditional schemes like RSA and ECC, which are vulnerable to Shor's algorithm. Core concepts, including lattice trapdoors, parameter optimization, and real-world applications in blockchain, cryptocurrencies, and secure communication protocols, are explored in detail. Furthermore, the paper highlights ongoing standardization efforts led by NIST, ethical considerations, practical challenges, and future research directions aimed at improving efficiency, ensuring interoperability, and expanding lattice cryptography’s use in advanced security frameworks. Through comprehensive analysis, this research underscores the importance of lattice-based cryptography as a critical pillar for securing the digital ecosystem against the emerging threat of quantum computing.

International Journal For Multidisciplinary Research•Mar 26, 2025•0 citations
The development of quantum-resistant solutions is imperative as the emergence of quantum computing presents a substantial risk to existing cryptography systems. Lattice-based cryptography, especially schemes based on the Learning with Errors (LWE) problem, is one of the most promising methods. To guarantee long-term security, even LWE-based methods could need to be strengthened further as quantum algorithms advance. By mixing Gaussian and discrete uniform distributions to create a mixed error distribution, this work enhances the classic LWE problem. The experimental findings show that, with a slight rise in computing overhead, the mixed error distribution improves the security of the LWE problem by strengthening its resistance to quantum techniques. By presenting a novel approach for enhancing the resilience of cryptographic methods in the quantum era, this research contributes to the continuing work in post-quantum cryptography. Moreover, it introduces the direction of future model improvements and provides multidisciplinary methods for increasing the complexity of cryptographic algorithms.
The fast development of quantum computing is a major threat to the classical cryptographic systems and the emergence of secure and efficient post-quantum cryptographic (PQC) is required.Lattice-based cryptography is one of the potential solutions that have been adopted as one of the promising solutions due to its excellent security grounds and quantum resistant nature.Nevertheless, there are difficulties of large key sizes, high computing power and flexibility to diverse application environments that plague existing lattice-based schemes.This paper introduces a new model which combines lattice-theoretic concepts and discrete optimization methods to improve the performance and scalability of PQC systems.Its methodology includes the use of optimization-based key generation, adaptive parameter choice, and using efficient encryption-decryption mechanisms that are based on the Learning With Errors (LWE) problem.Key metrics, such as key size, computation time and error rate, are used to evaluate the comprehensive performance and compared to the known schemes, such as Kyber, NTRU and Saber.Experimental evidence shows that the given model has the smaller key size of 2.4 KB, shorter calculation time of 13.9 ms and smaller error rate of 0.3 that is superior to existing techniques.The results suggest that the suggested framework offers the best compromise in terms of security, performance, and scalability, thus it is applicable to the next-generation secure communication framework in the post-quantum world.
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 swift advancement of quantum computing devices holds the potential to create robust machines that can tackle an extensive array of issues beyond the scope of conventional computers. Consequently, quantum computing machines create new risks at a velocity and scale never seen before, especially with regard to encryption. Lattice-based cryptography is regarded as post-quantum cryptography’s future and a competitor to a quantum computer attack. Thus, there are several advantages to lattice-based cryptographic protocols, including security, effectiveness, reduced energy usage and speed. In this work, we study the learning with errors (LWE) problem and the cryptosystems that are based on the LWE problem and, in addition, we present a new efficient variant of LWE cryptographic scheme.
This chapter introduces post-quantum cryptography. It describes lattice-based cryptographic constructions of post-quantum cryptography. Lattice-based cryptographic constructions are one of candidates of post-quantum cryptography, which are believed to be secure against quantum computers. Learning with errors (LWE) is one of the most promising primitives in many usages due to its lightweight operation and rigorous security reduction against the worst-case of the lattice problems that are considered to be hard to solve even after the advance of quantum computers. After the research about the connection between the LWE problem and some lattice problems, some variants of LWE, of which the secret distributions are modified from the uniform distribution, were proposed. Due to the efficiency and compactness of ring-LWE, many lattice-based cryptosystems are constructed as ring-LWE based, rather than LWE-based. The chapter explains a ring variant of Lizard scheme, called RLizard, IND-CCA secure encryption scheme.
The advancement of quantum computing poses a significant threat to classical cryptographic algorithms, particularly those based on factorization and discrete logarithm problems. In this paper, we propose a secure and quantum-resistant key exchange scheme leveraging the FrodoKEM algorithm, a lattice-based post-quantum key encapsulation mechanism designed to resist attacks from quantum adversaries. FrodoKEM, being based on the Learning with Errors (LWE) problem, offers a conservative and standard approach to post-quantum cryptography without relying on structured lattices. We compare the performance and security of the proposed scheme against traditional key exchange mechanisms such as RSA and Elliptic Curve Diffie-Hellman (ECDH), as well as other post-quantum algorithms like Kyber and NTRU. Our analysis demonstrates that FrodoKEM offers improved security assurances and competitive performance metrics, especially in environments where long-term confidentiality and forward secrecy are critical. The experimental results affirm FrodoKEM's suitability for real-world deployment in post-quantum secure communications.
This paper delves into lattice-based cryptography as a cornerstone of post-quantum cryptography (PQC), exploring its evolution, key principles, and applications. It examines how lattice-based schemes leverage the inherent hardness of problems such as the Shortest Vector Problem (SVP) and Learning With Errors (LWE) to provide quantum-resistant encryption, digital signatures, and homomorphic encryption. The paper also outlines the historical development of lattice-based cryptography, emphasizing its resilience to quantum attacks in contrast to traditional schemes like RSA and ECC, which are vulnerable to Shor's algorithm. Core concepts, including lattice trapdoors, parameter optimization, and real-world applications in blockchain, cryptocurrencies, and secure communication protocols, are explored in detail. Furthermore, the paper highlights ongoing standardization efforts led by NIST, ethical considerations, practical challenges, and future research directions aimed at improving efficiency, ensuring interoperability, and expanding lattice cryptography’s use in advanced security frameworks. Through comprehensive analysis, this research underscores the importance of lattice-based cryptography as a critical pillar for securing the digital ecosystem against the emerging threat of quantum computing.