A Variant of NTRU with Non-Invertible Polynomials

dc.contributor.author	Banks, William David, 1964-	eng
dc.contributor.author	Shparlinski, Igor E.	eng
dc.date.issued	2002	eng
dc.description	This is a preprint of a book chapter published in Lecture Notes in Computer Science, 2551, Springer-Verlag, Berlin (2003). The original publication is available at www.springerlink.com.	eng
dc.description.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.	eng
dc.identifier.uri	http://hdl.handle.net/10355/10632	eng
dc.relation.ispartof	Mathematics publications (MU)	eng
dc.relation.ispartofcommunity	University of Missouri-Columbia. College of Arts and Sciences. Department of Mathematics	eng
dc.source.uri	http://www.math.missouri.edu/~bbanks/papers/index.html	eng
dc.subject	public key cryptosystem	eng
dc.subject	public-key identification scheme	eng
dc.subject	asymmetric key algorithms	eng
dc.subject.lcsh	Cryptography	eng
dc.title	A Variant of NTRU with Non-Invertible Polynomials	eng
dc.type	Book chapter	eng

Mathematics publications (MU)
The items in this collection are the scholarly output of the faculty, staff, and students of the Department of Mathematics.