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 full item record


Title: A Variant of NTRU with Non-Invertible Polynomials
Author: Banks, William David, 1964-; Shparlinski, Igor E.
Keywords: public key cryptosystem
public-key identification scheme
asymmetric key algorithms
Date: 0000
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.
URI: http://hdl.handle.net/10355/10632

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 full item record