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

Apress eBooks

Lattice-Based Cryptography and NTRU

Ștefania Loredana Niță, Marius Iulian Mihăilescu

Published Jan 1, 2024• 0 citations
Publisher

Abstract

This chapter presents an important topic in cryptography, namely, the encryption schemes based on lattices. These structures are important because they have been proven they can be included in post-quantum cryptography. Lattices are one of the few techniques that can resist quantum attacks and are good candidates for encryption schemes for quantum computers.

DOI
10.1007/979-8-8688-0441-0_15

Related papers

Lattice-Based Cryptography and NTRU

Ștefania Loredana Niță, Marius Iulian Mihăilescu

This chapter presents an important topic in cryptography, namely, the encryption schemes based on lattices. These structures are important because it has been proven they can be included in post-quantum cryptography. Lattices are one of the few techniques that can resist quantum attacks and are good candidates for encryption schemes for quantum computers.

Apress eBooks•Jan 1, 2022•0 citations

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

Revathy M, D D, Natarajan K

RSA and ECC cryptography methods are classical methods based on the complexity of integer factorization and discrete logarithm problems, but these are in earnest danger due to the rapid advancements in quantum computing. Lattice-based encryption has also emerged as a post-quantum candidate encryption scheme in response to these weaknesses, because of its proven ability to resist quantum attacks. To ensure a safe and efficient transmission of data, the current study provides a lattice-based hybrid encryption model with the combination of two popular post-quantum schemes, NTRU and Kyber. The proposed system provides a powerful two-way key exchange and encryption system, based on a lattice-based key encapsulation mechanism (KEM) introduced by Kyber and the polynomial-based public key encryption introduced by NTRU. To ensure the safety of the exchange of key data, the actual message data is encrypted using a symmetric cipher known as AES (Advanced Encryption Standard), and the exchange of the session key is safely performed with the help of the hybrid NTRU Kyber framework. Using this method, we achieve high computing efficiency, forward secrecy, and resistance to quantum attacks. The project demonstrates the benefits of applying the lattice-based techniques in enhancing the overall security posture of encrypted communications by simulating and executing the techniques. The research results indicate the importance of hybrid post-quantum systems in the development of cryptographic systems that are resistant to novel quantum attacks.

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

On the Semantic Security of NTRU -- with a gentle introduction to cryptography

Liam Peet-Pare

This paper provides an explanation of NTRU, a post quantum encryption scheme, while also providing a gentle introduction to cryptography. NTRU is a very efficient lattice based cryptosystem that appears to be safe against attacks by quantum computers. NTRU's efficiency suggests that it is a strong candidate as an alternative to RSA, ElGamal, and ECC for the post quantum world. The paper begins with an introduction to cryptography and security proofs for cryptographic schemes before explaining the NTRU cryptosystem and culminating with a proof that the original presentation of NTRU is not IND-CPA secure. We will conclude by mentioning padding schemes to NTRU that are provably IND-CCA2 secure in the random oracle model. The paper is designed to be accessible to anyone with minimal background in abstract algebra and number theory - no previous knowledge of cryptography is assumed. Given the author's lack of familiarity with the subject, this paper aims to be an expository work rather than to provide new insights to the subject matter.

arXiv:2503.07790•Mar 10, 2025•2 citations

Research on Cryptography Based on Quantum-Resistant Algorithms

Yu Zhang

In this paper, we discuss the challenges of quantum computing to traditional cryptography and the latest development of post-quantum cryptography as a coping strategy. As quantum computing advances, cryptographic algorithms that rely on the complexity of classical computers, such as RSA and ECC, are at risk of failing, which has prompted the cryptography community to seek new encryption solutions. Post-quantum cryptography focuses on encryption technology and develops resistance to quantum computing attacks. It studies encryption schemes based on lattice theory, multivariate polynomials, coding theory, and hash functions. In addition, lattice-based cryptography is critical. It builds multiple algorithms, including RLWE and NTRU, focusing on LWE and SIS issues, demonstrating strong potential in a quantum computing environment. In terms of signature algorithms, Dilithium and Falcon lattice-based schemes are the focus of standardization. In the simulation analysis of these algorithms, we evaluated their security, efficiency, and compatibility, laying the theoretical and practical foundation for the cryptosystem transformation in the post-quantum era.

International Conference on Electronics and Devices, Computational Science (ICEDCS)•Sep 23, 2024•6 citations

Lattice-Based Cryptography and NTRU: Quantum-Resistant Encryption Algorithms

F. Nisha, J. Lenin, S. Saravanan +3 more

The quantum-resistant qualities of various encryption methods, such as N-th degree Truncated polynomial Ring Units (NTRU) Encrypt, NTRU Sign, Ring-Lizard, and Kyber protocols are becoming more important in light of the ever-evolving nature of digital threats. An-depth analysis of the mathematical derivation of these algorithms, as well as a determination of their computing efficiency and resistance to quantum assaults is discussed in this paper. Techniques of the Ring-Lizard and Kyber algorithms to lattice-based encryption are analyzed. The study gives an overview of quantum-resistant capabilities of these algorithms and their performance measures. Strengths and weaknesses of the NTRU Encrypt, NTRU Sign, Ring-Lizard, and Kyber algorithms are discussed. The results give useful insights for cybersecurity practitioners, academics, and policymakers, aiding them in making educated choices to protect digital infrastructures against quantum attacks.

International Conference on Emerging Systems and Intelligent Computing (ESIC)•Feb 9, 2024•6 citations

Lattice-Based Cryptosystems

Zhuo Liu, Yongkun Zhao, Lingcai Huang

This chapter introduces lattice-based cryptography, a critical mathematical framework for securing communications in the post-quantum era. While classical public-key cryptosystems rely on the intractability of integer factorization and discrete logarithms, these foundations are fundamentally vulnerable to quantum computing threats, specifically Shor's algorithm. To address this vulnerability, the text explores cryptosystems built upon the algebraic structure of lattices, defined as discrete points in $n$-dimensional Euclidean space generated by linearly independent vectors. The chapter systematically covers the mathematical properties of lattices, associated computational problems, and distance metrics. It provides an in-depth examination of lattice basis reduction algorithms, which are fundamental to both the design and security evaluation of these systems. Furthermore, the chapter details the operational mechanics—including encryption, decryption, and cryptanalysis—of prominent post-quantum architectures, specifically the GGH and NTRU public-key cryptosystems. By transitioning from classical number theory to high-dimensional geometry, this chapter equips readers with the cryptographic primitives necessary to withstand future quantum attacks.

CRC Press eBooks•Sep 18, 2026•0 citations
This chapter presents an important topic in cryptography, namely, the encryption schemes based on lattices. These structures are important because they have been proven they can be included in post-quantum cryptography. Lattices are one of the few techniques that can resist quantum attacks and are good candidates for encryption schemes for quantum computers.
RSA and ECC cryptography methods are classical methods based on the complexity of integer factorization and discrete logarithm problems, but these are in earnest danger due to the rapid advancements in quantum computing. Lattice-based encryption has also emerged as a post-quantum candidate encryption scheme in response to these weaknesses, because of its proven ability to resist quantum attacks. To ensure a safe and efficient transmission of data, the current study provides a lattice-based hybrid encryption model with the combination of two popular post-quantum schemes, NTRU and Kyber. The proposed system provides a powerful two-way key exchange and encryption system, based on a lattice-based key encapsulation mechanism (KEM) introduced by Kyber and the polynomial-based public key encryption introduced by NTRU. To ensure the safety of the exchange of key data, the actual message data is encrypted using a symmetric cipher known as AES (Advanced Encryption Standard), and the exchange of the session key is safely performed with the help of the hybrid NTRU Kyber framework. Using this method, we achieve high computing efficiency, forward secrecy, and resistance to quantum attacks. The project demonstrates the benefits of applying the lattice-based techniques in enhancing the overall security posture of encrypted communications by simulating and executing the techniques. The research results indicate the importance of hybrid post-quantum systems in the development of cryptographic systems that are resistant to novel quantum attacks.
This paper provides an explanation of NTRU, a post quantum encryption scheme, while also providing a gentle introduction to cryptography. NTRU is a very efficient lattice based cryptosystem that appears to be safe against attacks by quantum computers. NTRU's efficiency suggests that it is a strong candidate as an alternative to RSA, ElGamal, and ECC for the post quantum world. The paper begins with an introduction to cryptography and security proofs for cryptographic schemes before explaining the NTRU cryptosystem and culminating with a proof that the original presentation of NTRU is not IND-CPA secure. We will conclude by mentioning padding schemes to NTRU that are provably IND-CCA2 secure in the random oracle model. The paper is designed to be accessible to anyone with minimal background in abstract algebra and number theory - no previous knowledge of cryptography is assumed. Given the author's lack of familiarity with the subject, this paper aims to be an expository work rather than to provide new insights to the subject matter.
In this paper, we discuss the challenges of quantum computing to traditional cryptography and the latest development of post-quantum cryptography as a coping strategy. As quantum computing advances, cryptographic algorithms that rely on the complexity of classical computers, such as RSA and ECC, are at risk of failing, which has prompted the cryptography community to seek new encryption solutions. Post-quantum cryptography focuses on encryption technology and develops resistance to quantum computing attacks. It studies encryption schemes based on lattice theory, multivariate polynomials, coding theory, and hash functions. In addition, lattice-based cryptography is critical. It builds multiple algorithms, including RLWE and NTRU, focusing on LWE and SIS issues, demonstrating strong potential in a quantum computing environment. In terms of signature algorithms, Dilithium and Falcon lattice-based schemes are the focus of standardization. In the simulation analysis of these algorithms, we evaluated their security, efficiency, and compatibility, laying the theoretical and practical foundation for the cryptosystem transformation in the post-quantum era.
The quantum-resistant qualities of various encryption methods, such as N-th degree Truncated polynomial Ring Units (NTRU) Encrypt, NTRU Sign, Ring-Lizard, and Kyber protocols are becoming more important in light of the ever-evolving nature of digital threats. An-depth analysis of the mathematical derivation of these algorithms, as well as a determination of their computing efficiency and resistance to quantum assaults is discussed in this paper. Techniques of the Ring-Lizard and Kyber algorithms to lattice-based encryption are analyzed. The study gives an overview of quantum-resistant capabilities of these algorithms and their performance measures. Strengths and weaknesses of the NTRU Encrypt, NTRU Sign, Ring-Lizard, and Kyber algorithms are discussed. The results give useful insights for cybersecurity practitioners, academics, and policymakers, aiding them in making educated choices to protect digital infrastructures against quantum attacks.
This chapter introduces lattice-based cryptography, a critical mathematical framework for securing communications in the post-quantum era. While classical public-key cryptosystems rely on the intractability of integer factorization and discrete logarithms, these foundations are fundamentally vulnerable to quantum computing threats, specifically Shor's algorithm. To address this vulnerability, the text explores cryptosystems built upon the algebraic structure of lattices, defined as discrete points in nnn-dimensional Euclidean space generated by linearly independent vectors. The chapter systematically covers the mathematical properties of lattices, associated computational problems, and distance metrics. It provides an in-depth examination of lattice basis reduction algorithms, which are fundamental to both the design and security evaluation of these systems. Furthermore, the chapter details the operational mechanics—including encryption, decryption, and cryptanalysis—of prominent post-quantum architectures, specifically the GGH and NTRU public-key cryptosystems. By transitioning from classical number theory to high-dimensional geometry, this chapter equips readers with the cryptographic primitives necessary to withstand future quantum attacks.