>>219 https://en.wikipedia.org/wiki/NTRUEncrypt: Operations are based on objects in a truncated [[polynomial ring]] <math> \ R=Z[X]/(X^N-1) </math> with convolution multiplication and all polynomials in the ring have [[integer]] [[coefficient]]s and degree at most ''N''-1:
NTRU is actually a parameterised family of cryptosystems; each system is specified by three integer parameters (''N'', ''p'', ''q'') which represent the maximal degree <math> \ N-1 </math> for all polynomials in the truncated ring ''R'', a small modulus and a large modulus, respectively, where it is assumed that ''N'' is [[prime number|prime]], ''q'' is always larger than ''p'', and ''p'' and ''q'' are [[coprime]]; and four sets of polynomials <math> \ \mathcal{L}_f, \mathcal{L}_g, \mathcal{L}_m </math> and <math> \ \mathcal{L}_r </math> (a polynomial part of the private key, a polynomial for generation of the public key, the message and a blinding value, respectively), all of degree at most <math> \ N-1 </math>.