This time, suppose we have polynomial in the polynomial ring . Therefore, each coefficient of is an integer modulo . Polynomial decomposition expresses as a sum of multiple polynomials in base and level as follows:
Summary A-6.2 Polynomial Decomposition
Given , where:
We denote the decomposition of the polynomial into the base with the level as follows:
Suppose we have the following polynomial in the polynomial ring :
Suppose we want to decompose the above polynomial with base and level . Then, each degree’s coefficient of the polynomial is decomposed as follows:
:
:
:
:
The decomposed polynomial is as follows:
Note that after decomposition, the original coefficients of the polynomial got reduced to smaller numbers. This characteristic is importantly used in homomorphic encryption’s multiplication, for reducing the growth rate of the noise. Normally, the polynomial coefficients of ciphertexts are large because they are uniformly random numbers. Reducing such big constants is important to reduce the noise growth during homomorphic multiplication. We will discuss this more in detail in §D-1.6.