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

NTRU-LPR IND-CPA: A New Ideal Lattices-based Scheme.

Soda Diop, Bernard Ousmane Sane, Nafissatou Diarra, Michel Seck

Published Jan 1, 2018• 0 citations
OpenAlex

Related papers

Making NTRU as Secure as Worst-Case Problems over Ideal Lattices

Damien Stehlé, Ron Steinfeld

Lecture notes in computer science•Jan 1, 2011•458 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

Lattice Systems

Karsten Balzer, M. Bönitz

Lecture notes in physics•Dec 12, 2012•0 citations

Lattice theoretic notions

Miklós Rédei

Springer eBooks•Jan 1, 1998•0 citations

An IBE scheme based on hybrid sampler over NTRU lattice

Xiufeng Zhao, Yang Song, Aoyang Zhou +2 more

The identity-based encryption (IBE) scheme takes the user's identity as the public key, which avoids the disadvantages of digital certificate management. Lattice-based IBE scheme has the advantages of resistant to quantum attack, high efficiency and simple structure, and has become a research hotspot in the field of post-quantum information security. In this paper, an IBE scheme is designed based on NTRU lattice, and the hybrid sampling algorithm proposed by Ducas and Prest is used in the private key extraction algorithm of the scheme, which improves the implementation efficiency of the key generation algorithm while ensuring the security of the private key. The encryption and decryption algorithm of the IBE scheme is designed by using the framework structure of the encryption algorithm based on the LWE problem. Under the condition that the NTRU difficulty hypothesis and the LWE difficulty hypothesis hold simultaneously, the scheme is proved to have indistinguishability under chosen plaintext attack with identity-based encryption (IND-ID-CPA). The software implementation of the scheme and the efficiency under the specific parameter settings are given, and the experimental results show that the new scheme has higher encryption and decryption efficiency and shorter ciphertext length than the typical lattice IBE scheme.

International Journal of Information and Computer Security•Jan 1, 2025•0 citations

Disjoint Simulatability and Security Reduction of a Class of Lattice-Based Schemes

Baosheng Huang, Guoqing Zhou, Lin Wang +4 more

Security is the primary consideration for cryptographic algorithms. For key encapsulation mechanisms, it is generally required to satisfy indistinguishability under chosen ciphertext attacks(IND-CCA) in the quantum random oracle model(QROM). The approach of constructing IND-CCA-secure key encapsulation mechanisms from public-key encryption schemes that satisfy disjoint simulatability (DS) is tight. However, existing work on DS either does not consider decryption error rates or requires stronger security properties from the underlying schemes. In this work, we presents a DS-based reduction method that accounts for decryption errors without relying on IND-CPA and this method is applicable to most scenarios of lattice-based encryption schemes including LWE-baced and NTRU-based deterministic public key encryption(DPKE). This work can enhance confidence in the security of lattice-based encryption algorithms in the post-quantum era.

International Conference on Electronics and Communication, Network and Computer Technology (ECNCT)•Jul 1, 2026•0 citations
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.
The identity-based encryption (IBE) scheme takes the user's identity as the public key, which avoids the disadvantages of digital certificate management. Lattice-based IBE scheme has the advantages of resistant to quantum attack, high efficiency and simple structure, and has become a research hotspot in the field of post-quantum information security. In this paper, an IBE scheme is designed based on NTRU lattice, and the hybrid sampling algorithm proposed by Ducas and Prest is used in the private key extraction algorithm of the scheme, which improves the implementation efficiency of the key generation algorithm while ensuring the security of the private key. The encryption and decryption algorithm of the IBE scheme is designed by using the framework structure of the encryption algorithm based on the LWE problem. Under the condition that the NTRU difficulty hypothesis and the LWE difficulty hypothesis hold simultaneously, the scheme is proved to have indistinguishability under chosen plaintext attack with identity-based encryption (IND-ID-CPA). The software implementation of the scheme and the efficiency under the specific parameter settings are given, and the experimental results show that the new scheme has higher encryption and decryption efficiency and shorter ciphertext length than the typical lattice IBE scheme.
Security is the primary consideration for cryptographic algorithms. For key encapsulation mechanisms, it is generally required to satisfy indistinguishability under chosen ciphertext attacks(IND-CCA) in the quantum random oracle model(QROM). The approach of constructing IND-CCA-secure key encapsulation mechanisms from public-key encryption schemes that satisfy disjoint simulatability (DS) is tight. However, existing work on DS either does not consider decryption error rates or requires stronger security properties from the underlying schemes. In this work, we presents a DS-based reduction method that accounts for decryption errors without relying on IND-CPA and this method is applicable to most scenarios of lattice-based encryption schemes including LWE-baced and NTRU-based deterministic public key encryption(DPKE). This work can enhance confidence in the security of lattice-based encryption algorithms in the post-quantum era.