A variant of NTRU with non-invertible polynomials

William D. Banks, Igor E. Shparlinski

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

14 Citations (Scopus)

Abstract

We introduce a generalization of the NTRU cryptosystem and describe its advantages and disadvantages as compared with the original NTRU protocol. This extension helps to avoid the potential problem of finding “enough” invertible polynomials within very thin sets of polynomials, as in the original version of NTRU. This generalization also exhibits certain attractive “pseudorandomness” properties that can be proved rigorously using bounds for exponential sums.

Original languageEnglish
Title of host publicationProgress in Cryptology — INDOCRYPT 2002
Subtitle of host publicationThird International Conference on Cryptology in India Hyderabad, India, December 16–18, 2002 Proceedings
EditorsAlfred Menezes, Palash Sarkar
Place of PublicationBerlin
PublisherSpringer, Springer Nature
Pages62-70
Number of pages9
ISBN (Print)9783540362319
DOIs
Publication statusPublished - 2002
Event3rd International Conference on Cryptology in India, INDOCRYPT 2002 - Hyderabad, India
Duration: 16 Dec 200218 Dec 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2551
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other3rd International Conference on Cryptology in India, INDOCRYPT 2002
CountryIndia
CityHyderabad
Period16/12/0218/12/02

Fingerprint Dive into the research topics of 'A variant of NTRU with non-invertible polynomials'. Together they form a unique fingerprint.

Cite this