Implementation of Polynomials

LatBuilder uses the NTL library to manipulate polynomials over \(\mathbb{Z}_2\) The Input/Output format used is the same as in NTL: The polynomial \( \sum_{i=0}^{n} a_iz^i \) is represented by [ \(a_0\)... \(a_n\)].

In the examples shown here, we construct polynomial from integers using a binary conversion. The integer \( i = \sum a_j2^j \) is seen as the polynomial \( i(z) = \sum a_jz^j \)

   Polynomial P = PolynomialFromInt(13); //13 = 1 + 2^2 + 2^3
   std::cout << P << std::endl;

outputs

[1 0 1 1]