Polynomial bit-length n.

Number of ulong limbs required to hold a polynomial of length N.

Compute z = x^{-1} mod f(x). By convention 0 maps to 0 — there is no special case for it (nor for 1); both fall out of the computation, so the running cost is independent of the element value. x may alias z.