Saved in:
Bibliographic Details
Main Author: Peet-Pare, Liam
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2503.07790
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916648554856448
author Peet-Pare, Liam
author_facet Peet-Pare, Liam
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2503_07790
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle On the Semantic Security of NTRU -- with a gentle introduction to cryptography
Peet-Pare, Liam
Cryptography and Security
Number Theory
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.
title On the Semantic Security of NTRU -- with a gentle introduction to cryptography
topic Cryptography and Security
Number Theory
url https://arxiv.org/abs/2503.07790