A-6.2 Polynomial Decomposition

This time, suppose we have polynomial f in the polynomial ring q[x](xn + 1). Therefore, each coefficient ci of f is an integer modulo q. Polynomial decomposition expresses f as a sum of multiple polynomials in base β and level l as follows:

Summary A-6.2 Polynomial Decomposition

Given f q[z](xn + 1), where:

f = f1 q β1 + f2 q β2 + + fl q βl

We denote the decomposition of the polynomial f into the base β with the level l as follows:

𝖣𝖾𝖼𝗈𝗆𝗉β,l(f) = (f1,f2, , fl)

A-6.2.1 Example

Suppose we have the following polynomial in the polynomial ring 16[x](x4 + 1):

f = 6x3 + 3x2 + 14x + 7 16[x](x4 + 1)

Suppose we want to decompose the above polynomial with base β = 4 and level l = 2. Then, each degree’s coefficient of the polynomial f is decomposed as follows:

𝐱3: 6 = 1 16 41 + 2 16 42

𝐱2: 3 = 0 16 41 + 3 16 42

𝐱1: 14 = 3 16 41 + 2 16 42

𝐱0: 7 = 1 16 41 + 3 16 42

The decomposed polynomial is as follows:

f = 6x3 + 3x2 + 14x + 7 = (1x3 + 0x2 + 3x + 1) 16 41 + (2x3 + 3x2 + 2x + 3) 16 42

𝖣𝖾𝖼𝗈𝗆𝗉4,2(6x3 + 3x2 + 14x + 7) = (1x3 + 0x2 + 3x + 1,2x3 + 3x2 + 2x + 3)

A-6.2.2 Discussion

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.