A variant of NTRU with non-invertible polynomials

William D. Banks; Igor E. Shparlinski

doi:10.1007/3-540-36231-2_6

A variant of NTRU with non-invertible polynomials

William D. Banks, Igor E. Shparlinski

School of Computing

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

20 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 language	English
Title of host publication	Progress in Cryptology — INDOCRYPT 2002
Subtitle of host publication	Third International Conference on Cryptology in India Hyderabad, India, December 16–18, 2002 Proceedings
Editors	Alfred Menezes, Palash Sarkar
Place of Publication	Berlin
Publisher	Springer, Springer Nature
Pages	62-70
Number of pages	9
ISBN (Print)	9783540362319
DOIs	https://doi.org/10.1007/3-540-36231-2_6
Publication status	Published - 2002
Event	3rd International Conference on Cryptology in India, INDOCRYPT 2002 - Hyderabad, India Duration: 16 Dec 2002 → 18 Dec 2002

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2551
ISSN (Print)	03029743
ISSN (Electronic)	16113349

Other

Other	3rd International Conference on Cryptology in India, INDOCRYPT 2002
Country/Territory	India
City	Hyderabad
Period	16/12/02 → 18/12/02

Access to Document

10.1007/3-540-36231-2_6

Cite this

Banks, W. D., & Shparlinski, I. E. (2002). A variant of NTRU with non-invertible polynomials. In A. Menezes, & P. Sarkar (Eds.), Progress in Cryptology — INDOCRYPT 2002: Third International Conference on Cryptology in India Hyderabad, India, December 16–18, 2002 Proceedings (pp. 62-70). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2551). Springer, Springer Nature. https://doi.org/10.1007/3-540-36231-2_6

Banks, William D. ; Shparlinski, Igor E. / A variant of NTRU with non-invertible polynomials. Progress in Cryptology — INDOCRYPT 2002: Third International Conference on Cryptology in India Hyderabad, India, December 16–18, 2002 Proceedings. editor / Alfred Menezes ; Palash Sarkar. Berlin : Springer, Springer Nature, 2002. pp. 62-70 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{152fe09522ce4ac3b80377a6a47ad021,

title = "A variant of NTRU with non-invertible polynomials",

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.",

author = "Banks, {William D.} and Shparlinski, {Igor E.}",

year = "2002",

doi = "10.1007/3-540-36231-2_6",

language = "English",

isbn = "9783540362319",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer, Springer Nature",

pages = "62--70",

editor = "Alfred Menezes and Palash Sarkar",

booktitle = "Progress in Cryptology — INDOCRYPT 2002",

address = "United States",

note = "3rd International Conference on Cryptology in India, INDOCRYPT 2002 ; Conference date: 16-12-2002 Through 18-12-2002",

}

Banks, WD & Shparlinski, IE 2002, A variant of NTRU with non-invertible polynomials. in A Menezes & P Sarkar (eds), Progress in Cryptology — INDOCRYPT 2002: Third International Conference on Cryptology in India Hyderabad, India, December 16–18, 2002 Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2551, Springer, Springer Nature, Berlin, pp. 62-70, 3rd International Conference on Cryptology in India, INDOCRYPT 2002, Hyderabad, India, 16/12/02. https://doi.org/10.1007/3-540-36231-2_6

A variant of NTRU with non-invertible polynomials. / Banks, William D.; Shparlinski, Igor E.
Progress in Cryptology — INDOCRYPT 2002: Third International Conference on Cryptology in India Hyderabad, India, December 16–18, 2002 Proceedings. ed. / Alfred Menezes; Palash Sarkar. Berlin: Springer, Springer Nature, 2002. p. 62-70 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2551).

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - A variant of NTRU with non-invertible polynomials

AU - Banks, William D.

AU - Shparlinski, Igor E.

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84974720059&partnerID=8YFLogxK

U2 - 10.1007/3-540-36231-2_6

DO - 10.1007/3-540-36231-2_6

M3 - Conference proceeding contribution

AN - SCOPUS:84974720059

SN - 9783540362319

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 62

EP - 70

BT - Progress in Cryptology — INDOCRYPT 2002

A2 - Menezes, Alfred

A2 - Sarkar, Palash

PB - Springer, Springer Nature

CY - Berlin

T2 - 3rd International Conference on Cryptology in India, INDOCRYPT 2002

Y2 - 16 December 2002 through 18 December 2002

ER -

Banks WD, Shparlinski IE. A variant of NTRU with non-invertible polynomials. In Menezes A, Sarkar P, editors, Progress in Cryptology — INDOCRYPT 2002: Third International Conference on Cryptology in India Hyderabad, India, December 16–18, 2002 Proceedings. Berlin: Springer, Springer Nature. 2002. p. 62-70. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-36231-2_6

A variant of NTRU with non-invertible polynomials

Abstract

Publication series

Other

Access to Document

Other files and links

Fingerprint

Cite this