A Variant of NTRU with Non-Invertible Polynomials

MOspace/Manakin Repository

Breadcrumbs Navigation

A Variant of NTRU with Non-Invertible Polynomials

Please use this identifier to cite or link to this item: http://hdl.handle.net/10355/10632

[-] show simple item record

dc.contributor.author Banks, William David, 1964-
dc.contributor.author Shparlinski, Igor E.
dc.date.accessioned 2011-05-03T16:58:32Z
dc.date.available 2011-05-03T16:58:32Z
dc.date.issued 0000
dc.identifier.uri http://hdl.handle.net/10355/10632
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. en_US
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. en_US
dc.language.iso en_US en_US
dc.relation.ispartof Mathematics publications (MU) en
dc.source.uri http://www.math.missouri.edu/~bbanks/papers/index.html en_US
dc.subject public key cryptosystem en_US
dc.subject public-key identification scheme en_US
dc.subject asymmetric key algorithms en_US
dc.subject.lcsh Cryptography en_US
dc.title A Variant of NTRU with Non-Invertible Polynomials en_US
dc.type Book chapter en_US
dc.relation.ispartofcommunity University of Missouri-Columbia. College of Arts and Sciences. Department of Mathematics


This item appears in the following Collection(s)

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

[-] show simple item record