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.
Cite
CITATION STYLE
Banks, W. D., & Shparlinski, I. E. (2002). A variant of NTRU with non-invertible polynomials. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2551, pp. 62–70). Springer Verlag. https://doi.org/10.1007/3-540-36231-2_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
