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

arXiv:2503.07790

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

Liam Peet-Pare

Published Mar 10, 2025• 2 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2503.07790

Related papers

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

Comparative analysis of NTRU against classical and lattice-based cryptosystems

Harshdeep Jaywant, Jatin Jatin, Kanhaiya Singh +2 more

The advent of quantum computers poses a serious threat to conventional cryptographic algorithms like RSA and ECC that are built around mathematical challenges solvable by quantum algorithms efficiently. To counter the new threat, novel cryptographic systems, such as lattice-based algorithms like NTRU, are being contemplated for their for their quantum attack resistance. This paper provides a comparative analysis of NTRU with traditional cryptography algorithms (RSA, ECC) and other prominent post-quantum candidates (Kyber, Dilithium) in four most important application spaces: Internet of Things (IoT), cloud security, healthcare, and military communications. Comparison and contrast of primary parameters like security strength, computational speed, key sizes, and flexibility of each algorithm towards real-world deployment. These findings illustrate the advantages and disadvantages of each cryptosystem, an insight into their performance.

CRC Press eBooks•Nov 6, 2025•1 citation

Lattice Foundations for Post-Quantum Cryptography: Beyond the RSA Frontier

Revista, Zen, MATH, 10

The advent of large-scale quantum computers poses an existential threat to the security of current public-key cryptosystems, such as RSA and Elliptic Curve Cryptography (ECC), which rely on the computational intractability of integer factorization and discrete logarithms. This paper explores lattice-based cryptography as a promising candidate for post-quantum security. We delve into the mathematical foundations of lattices, specifically focusing on hard problems like the Shortest Vector Problem (SVP), Closest Vector Problem (CVP), Small Integer Solution (SIS), and Learning With Errors (LWE) problems, which are believed to remain intractable even for quantum computers. We provide a comprehensive review of prominent lattice-based constructions, including NTRU, Kyber, and Dilithium, highlighting their security proofs, efficiency considerations, and suitability for various cryptographic primitives such as public-key encryption, key-exchange mechanisms, and digital signatures. Furthermore, we discuss the challenges and opportunities associated with their deployment, including parameter selection, resistance to side-channel attacks, and integration into existing cryptographic infrastructures. By examining the theoretical underpinnings and practical implications, this work aims to solidify understanding of lattice-based methods as a robust and essential component of the cryptographic landscape in the quantum era, moving beyond the traditional RSA frontier.

•Dec 6, 2025•0 citations

NTRUReEncrypt: An Efficient Proxy Re-Encryption Scheme Based on NTRU

David Núñez, Isaac Agudo, Javier López

The use of alternative foundations for constructing more secure and efficient cryptographic schemes is a topic worth exploring. In the case of proxy re-encryption, the vast majority of schemes are based on number theoretic problems such as the discrete logarithm. In this paper we present NTRUReEncrypt, a new bidirectional and multihop proxy re-encryption scheme based on NTRU, a widely known lattice-based cryptosystem. We provide two versions of our scheme: the first one is based on the conventional NTRU encryption scheme and, although it lacks a security proof, remains as efficient as its predecessor; the second one is based on a variant of NTRU proposed by Stehlé and Steinfeld, which is proven CPA-secure under the hardness of the Ring-LWE problem. To the best of our knowledge, our proposals are the first proxy re-encryption schemes to be based on the NTRU primitive. In addition, we provide experimental results to show the efficiency of our proposal, as well as a comparison with previous proxy re-encryption schemes, which confirms that our first scheme outperforms the rest by an order of magnitude.

ACM Asia Conference on Computer and Communications Security (ASIA CCS)•Apr 3, 2015•46 citations

Enhanced Provably Secure NTRU Encryption Based on Hard Learning over Rings

Wu Fang, Zheng Huang, Wang Li Cheng +1 more

Since the presentation of NTRU public-key cryptosystem by Hoffstein, Pipher and Silverman, its favorable properties, such as easily created keys, high speed, excellent performance and conjectured resistance to quantum computers, have made it to be of great use. This paper proposes an enhanced scheme based on the hard learning with error over ring (R-LWE) problem to improve the security of the modified NTRUEncrypt presented by Stehle and Steinfled. We used part of the padding ideas of Fujisaki and Okamoto to obtain this scheme. It is semantically secure in strong sense of indistinguishability against adaptive chosen-ciphertext attacks in the random oracle model assuming the quantum hardness of standard worst-case problem over ideal lattices. It is also possible to arbitrarily decrease the error probability, and even to eliminate it completely. We gave the detailed analysis using the known results from classic works. Furthermore, this scheme owns many advantages such as the uniformity of public key, usual assumptions and the freedom for coding messages.

Applied Mechanics and Materials•Nov 1, 2012•0 citations

An Efficient Post-Quantum User Authentication Protocol for Wireless Sensor Networks Using NTRU

Wei Shen, Jiaqing Mo, Yuhua Lin

Wireless sensor networks (WSNs) are pervasively employed in critical domains such as smart healthcare, industrial automation, and environmental surveillance, where secure access control is essential. User authentication protocols are vital for thwarting unauthorized intrusions, yet the vast majority of existing schemes rely on conventional public-key cryptography (such as ECC, RSA), which is provably insecure in the post-quantum era due to Shor's algorithm. This motivates the design of post-quantum authentication that is also lightweight for resource-limited sensors. To address this challenge, we propose an efficient authentication and key agreement protocol based on Number Theory Research Unit (NTRU), a lattice-based cryptosystem offering proven resistance to quantum attacks. We have proven the correctness and security of our scheme through BAN logic and random oracle model and demonstrated through informal analysis that our scheme can resist various attack methods and possesses high security features. Moreover, we thoroughly evaluate our protocol against the most recent state-of-the-art schemes. The results indicate that our scheme has the lowest computational cost, and its communication cost is superior to that of most other schemes. Overall, our proposed protocol provides a robust, efficient, and future-proof authentication solution for WSNs, well-suited for deploying WSNs environments.

Entropy•Sep 24, 2026•1 citation
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.
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.
The advent of quantum computers poses a serious threat to conventional cryptographic algorithms like RSA and ECC that are built around mathematical challenges solvable by quantum algorithms efficiently. To counter the new threat, novel cryptographic systems, such as lattice-based algorithms like NTRU, are being contemplated for their for their quantum attack resistance. This paper provides a comparative analysis of NTRU with traditional cryptography algorithms (RSA, ECC) and other prominent post-quantum candidates (Kyber, Dilithium) in four most important application spaces: Internet of Things (IoT), cloud security, healthcare, and military communications. Comparison and contrast of primary parameters like security strength, computational speed, key sizes, and flexibility of each algorithm towards real-world deployment. These findings illustrate the advantages and disadvantages of each cryptosystem, an insight into their performance.
The advent of large-scale quantum computers poses an existential threat to the security of current public-key cryptosystems, such as RSA and Elliptic Curve Cryptography (ECC), which rely on the computational intractability of integer factorization and discrete logarithms. This paper explores lattice-based cryptography as a promising candidate for post-quantum security. We delve into the mathematical foundations of lattices, specifically focusing on hard problems like the Shortest Vector Problem (SVP), Closest Vector Problem (CVP), Small Integer Solution (SIS), and Learning With Errors (LWE) problems, which are believed to remain intractable even for quantum computers. We provide a comprehensive review of prominent lattice-based constructions, including NTRU, Kyber, and Dilithium, highlighting their security proofs, efficiency considerations, and suitability for various cryptographic primitives such as public-key encryption, key-exchange mechanisms, and digital signatures. Furthermore, we discuss the challenges and opportunities associated with their deployment, including parameter selection, resistance to side-channel attacks, and integration into existing cryptographic infrastructures. By examining the theoretical underpinnings and practical implications, this work aims to solidify understanding of lattice-based methods as a robust and essential component of the cryptographic landscape in the quantum era, moving beyond the traditional RSA frontier.
The use of alternative foundations for constructing more secure and efficient cryptographic schemes is a topic worth exploring. In the case of proxy re-encryption, the vast majority of schemes are based on number theoretic problems such as the discrete logarithm. In this paper we present NTRUReEncrypt, a new bidirectional and multihop proxy re-encryption scheme based on NTRU, a widely known lattice-based cryptosystem. We provide two versions of our scheme: the first one is based on the conventional NTRU encryption scheme and, although it lacks a security proof, remains as efficient as its predecessor; the second one is based on a variant of NTRU proposed by Stehlé and Steinfeld, which is proven CPA-secure under the hardness of the Ring-LWE problem. To the best of our knowledge, our proposals are the first proxy re-encryption schemes to be based on the NTRU primitive. In addition, we provide experimental results to show the efficiency of our proposal, as well as a comparison with previous proxy re-encryption schemes, which confirms that our first scheme outperforms the rest by an order of magnitude.
Since the presentation of NTRU public-key cryptosystem by Hoffstein, Pipher and Silverman, its favorable properties, such as easily created keys, high speed, excellent performance and conjectured resistance to quantum computers, have made it to be of great use. This paper proposes an enhanced scheme based on the hard learning with error over ring (R-LWE) problem to improve the security of the modified NTRUEncrypt presented by Stehle and Steinfled. We used part of the padding ideas of Fujisaki and Okamoto to obtain this scheme. It is semantically secure in strong sense of indistinguishability against adaptive chosen-ciphertext attacks in the random oracle model assuming the quantum hardness of standard worst-case problem over ideal lattices. It is also possible to arbitrarily decrease the error probability, and even to eliminate it completely. We gave the detailed analysis using the known results from classic works. Furthermore, this scheme owns many advantages such as the uniformity of public key, usual assumptions and the freedom for coding messages.
Wireless sensor networks (WSNs) are pervasively employed in critical domains such as smart healthcare, industrial automation, and environmental surveillance, where secure access control is essential. User authentication protocols are vital for thwarting unauthorized intrusions, yet the vast majority of existing schemes rely on conventional public-key cryptography (such as ECC, RSA), which is provably insecure in the post-quantum era due to Shor's algorithm. This motivates the design of post-quantum authentication that is also lightweight for resource-limited sensors. To address this challenge, we propose an efficient authentication and key agreement protocol based on Number Theory Research Unit (NTRU), a lattice-based cryptosystem offering proven resistance to quantum attacks. We have proven the correctness and security of our scheme through BAN logic and random oracle model and demonstrated through informal analysis that our scheme can resist various attack methods and possesses high security features. Moreover, we thoroughly evaluate our protocol against the most recent state-of-the-art schemes. The results indicate that our scheme has the lowest computational cost, and its communication cost is superior to that of most other schemes. Overall, our proposed protocol provides a robust, efficient, and future-proof authentication solution for WSNs, well-suited for deploying WSNs environments.