Note that there are some explanatory texts on larger screens.

plurals
  1. POAlgorithm for computing the inverse of a polynomial
    primarykey
    data
    text
    singulars
    1. This table or related slice is empty.
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. COWhich inverse? Do you want the inverse function, to solve (i.e. factorise) polynomials, or do you want to find their multiplicative inverses in the field formed as the quotient of the polynomials over some base field, and an irreducible polynomial? NTRU stands for "Number Theorists R Us", IIRC, so it's difficult to intuit just what mathematics is required. http://en.wikipedia.org/wiki/NTRUEncrypt says "both encryption and decryption use only simple polynomial multiplication", so that article didn't tell me what you mean either. Whatever is needed, this could be a MathOverflow question.
      singulars
    2. COhere http://www.ntru.com/cryptolab/tutorial_algebra.htm#three
      singulars
    3. COGotcha. It's more like the second thing I said, although not actually the field I described but a slightly different ring (not all inverses exist). If you read NTRU technical note 14, there's an explanation at the end, after the pseudo-code, of "why it works". It's kind of like inverting a matrix by row-reduction, in the sense that you apply a bunch of transforms until you get 1, then the inverse is all the inverses of those transforms multiplied together. That's what the pseudo-code is doing. But I don't claim to have fully digested note 14, I just skimmed it.
      singulars
 

Querying!

 
Guidance

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload