A Variant of NTRU with Non-invertible Polynomials | Zendy

William D. Banks | Zendy; Igor E. Shparlinski | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Variant of NTRU with Non-invertible Polynomials

Author(s) -

William D. Banks,

Igor E. Shparlinski

Publication year - 2002

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-00263-4

DOI - 10.1007/3-540-36231-2_6

Subject(s) - ntru , invertible matrix , generalization , cryptosystem , computer science , exponential function , mathematics , discrete mathematics , algebra over a field , cryptography , algorithm , pure mathematics , mathematical analysis

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research