[-] Show simple item record

dc.contributor.authorBanks, William David, 1964-
dc.contributor.authorShparlinski, Igor E.
dc.descriptionThis 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.en_US
dc.description.abstractWe 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.en_US
dc.relation.ispartofMathematics publications (MU)en
dc.relation.ispartofcommunityUniversity of Missouri-Columbia. College of Arts and Sciences. Department of Mathematics
dc.subjectpublic key cryptosystemen_US
dc.subjectpublic-key identification schemeen_US
dc.subjectasymmetric key algorithmsen_US
dc.titleA Variant of NTRU with Non-Invertible Polynomialsen_US
dc.typeBook chapteren_US

Files in this item


This item appears in the following Collection(s)

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

[-] Show simple item record