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

Journal of Discrete Mathematical Sciences and Cryptography

Post-quantum cryptographic schemes using lattice problems

Mohammed Ali Khan, Afreen Khatoon, Hafiz Tariq, Tahreem Khan

Published Oct 31, 2026• 0 citations
Publisher

Abstract

The quick progress of quantum computing is a considerable risk to the classical cryptography of the public key and, the creation of quantum-resistant analogs is necessary.This paper provides a generalized architecture of post-quantum cryptographic schemes, by using lattice problems, especially Learning with Errors (LWE) and Ring-LWE (RLWE).The suggested architecture combines the secure public-key encryption and key encapsulation mechanisms (KEMs) with the implementation in the IoT, blockchain, and cloud setup.An original latticebased encryption design is developed that hybridizes with classical cryptographic primitives to

DOI
10.47974/jdmsc-3032

Related papers

Reconstructing Public-Key Cryptography: Lattice Foundations for a Post-Quantum Future Beyond RSA

Revista, Zen, MATH, 10

The imminent threat posed by the advent of quantum computers to contemporary public-key cryptographic schemes, such as RSA and Elliptic Curve Cryptography (ECC), necessitates a fundamental shift in cryptographic paradigms. Shor's algorithm, specifically, presents a catastrophic vulnerability to these foundational security protocols, underpinning global digital communication and commerce. This paper provides a comprehensive exploration into lattice-based cryptography as a robust and promising candidate for a post-quantum cryptographic future. We delve into the mathematical underpinnings of lattices, elucidating the computational hardness of problems like the Shortest Vector Problem (SVP) and the Learning With Errors (LWE) problem, which form the bedrock of their security. The paper reviews the historical development of lattice-based schemes, their theoretical advantages, and their practical implications, particularly in the context of the ongoing NIST Post-Quantum Cryptography standardization process. We analyze the construction of key encapsulation mechanisms (KEMs) and digital signature schemes from lattice problems, comparing their performance characteristics and security guarantees against classical methods. The work argues that lattice-based cryptography offers a compelling alternative to RSA, providing not only quantum resistance but also presenting attractive features in terms of efficiency, design simplicity, and versatility for various cryptographic primitives. The discussion extends to implementation challenges, security analysis, and the broader implications for the global migration towards a quantum-secure cryptographic infrastructure.

•Dec 5, 2025•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

On Advances of Lattice-Based Cryptographic Schemes and Their Implementations

Harshana Bandara, Yasitha Herath, Thushara Weerasundara +1 more

Lattice-based cryptography is centered around the hardness of problems on lattices. A lattice is a grid of points that stretches to infinity. With the development of quantum computers, existing cryptographic schemes are at risk because the underlying mathematical problems can, in theory, be easily solved by quantum computers. Since lattice-based mathematical problems are hard to be solved even by quantum computers, lattice-based cryptography is a promising foundation for future cryptographic schemes. In this paper, we focus on lattice-based public-key encryption schemes. This survey presents the current status of the lattice-based public-key encryption schemes and discusses the existing implementations. Our main focus is the learning with errors problem (LWE problem) and its implementations. In this paper, the plain lattice implementations and variants with special algebraic structures such as ring-based variants are discussed. Additionally, we describe a class of lattice-based functions called lattice trapdoors and their applications.

Cryptography•Nov 9, 2022•40 citations

An Extensive Study on Lattice-Based Cryptography and its Applications for RLWE-Based Problems

Sonam Yadav

Lattice-based cryptography has emerged as a powerful paradigm for constructing secure cryptographic primitives, offering resistance to quantum attacks and providing a versatile framework for building post-quantum cryptographic systems. This research paper provides an in-depth exploration of lattice-based cryptography, focusing specifically on its applications for problems based on Ring Learning with Errors (RLWE). We analyze the fundamental concepts of lattice theory, delve into the RLWE problem, and highlight the security properties and challenges associated with lattice-based schemes. Furthermore, we discuss various real-world applications of lattice-based cryptography, demonstrating its potential for secure communication, privacy-preserving protocols, and post-quantum cryptography.

Universal Research Reports•Sep 23, 2023•4 citations

Lattice-Based RLWE Key Generation Using ECC

Ahmad Homsi, Mustafa A. Al-Fayoumi, Mohammad Al-Fawa’reh

The rapid advancement of quantum computing poses a significant threat to modern cryptographic systems, with algorithms such as Shor's, which can break RSA and ECC, and Grover's, which can weaken symmetric-key systems. In response, post-quantum cryptography aims to develop secure protocols resilient to quantum attacks. This paper introduces a lattice-based key generation mechanism that combines the Ring Learning With Errors (RLWE) problem with ECC. Using the secp256r1 curve, ECC keys are transformed into polynomials suitable for RLWE-based cryptographic schemes via KECCAK hash functions. The performance of this hybrid approach is assessed through key generation time and CPU cycle analysis, demonstrating its efficiency and potential for post-quantum cryptography.

International Jordanian Cybersecurity Conference (IJCC)•Dec 17, 2024•1 citation

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
The quick progress of quantum computing is a considerable risk to the classical cryptography of the public key and, the creation of quantum-resistant analogs is necessary.This paper provides a generalized architecture of post-quantum cryptographic schemes, by using lattice problems, especially Learning with Errors (LWE) and Ring-LWE (RLWE).The suggested architecture combines the secure public-key encryption and key encapsulation mechanisms (KEMs) with the implementation in the IoT, blockchain, and cloud setup.An original latticebased encryption design is developed that hybridizes with classical cryptographic primitives to
The imminent threat posed by the advent of quantum computers to contemporary public-key cryptographic schemes, such as RSA and Elliptic Curve Cryptography (ECC), necessitates a fundamental shift in cryptographic paradigms. Shor's algorithm, specifically, presents a catastrophic vulnerability to these foundational security protocols, underpinning global digital communication and commerce. This paper provides a comprehensive exploration into lattice-based cryptography as a robust and promising candidate for a post-quantum cryptographic future. We delve into the mathematical underpinnings of lattices, elucidating the computational hardness of problems like the Shortest Vector Problem (SVP) and the Learning With Errors (LWE) problem, which form the bedrock of their security. The paper reviews the historical development of lattice-based schemes, their theoretical advantages, and their practical implications, particularly in the context of the ongoing NIST Post-Quantum Cryptography standardization process. We analyze the construction of key encapsulation mechanisms (KEMs) and digital signature schemes from lattice problems, comparing their performance characteristics and security guarantees against classical methods. The work argues that lattice-based cryptography offers a compelling alternative to RSA, providing not only quantum resistance but also presenting attractive features in terms of efficiency, design simplicity, and versatility for various cryptographic primitives. The discussion extends to implementation challenges, security analysis, and the broader implications for the global migration towards a quantum-secure cryptographic infrastructure.
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.
Lattice-based cryptography is centered around the hardness of problems on lattices. A lattice is a grid of points that stretches to infinity. With the development of quantum computers, existing cryptographic schemes are at risk because the underlying mathematical problems can, in theory, be easily solved by quantum computers. Since lattice-based mathematical problems are hard to be solved even by quantum computers, lattice-based cryptography is a promising foundation for future cryptographic schemes. In this paper, we focus on lattice-based public-key encryption schemes. This survey presents the current status of the lattice-based public-key encryption schemes and discusses the existing implementations. Our main focus is the learning with errors problem (LWE problem) and its implementations. In this paper, the plain lattice implementations and variants with special algebraic structures such as ring-based variants are discussed. Additionally, we describe a class of lattice-based functions called lattice trapdoors and their applications.
Lattice-based cryptography has emerged as a powerful paradigm for constructing secure cryptographic primitives, offering resistance to quantum attacks and providing a versatile framework for building post-quantum cryptographic systems. This research paper provides an in-depth exploration of lattice-based cryptography, focusing specifically on its applications for problems based on Ring Learning with Errors (RLWE). We analyze the fundamental concepts of lattice theory, delve into the RLWE problem, and highlight the security properties and challenges associated with lattice-based schemes. Furthermore, we discuss various real-world applications of lattice-based cryptography, demonstrating its potential for secure communication, privacy-preserving protocols, and post-quantum cryptography.
The rapid advancement of quantum computing poses a significant threat to modern cryptographic systems, with algorithms such as Shor's, which can break RSA and ECC, and Grover's, which can weaken symmetric-key systems. In response, post-quantum cryptography aims to develop secure protocols resilient to quantum attacks. This paper introduces a lattice-based key generation mechanism that combines the Ring Learning With Errors (RLWE) problem with ECC. Using the secp256r1 curve, ECC keys are transformed into polynomials suitable for RLWE-based cryptographic schemes via KECCAK hash functions. The performance of this hybrid approach is assessed through key generation time and CPU cycle analysis, demonstrating its efficiency and potential for post-quantum cryptography.
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.