A-6.1 Number Decomposition

We fix a modulus q ≥2 and write ℤq = ℤ∕𝑞ℤ. Let γ ∈ ℤq. Number decomposition expresses γ as a sum of multiple numbers in base β as follows:

γ = γ1 q β1 + γ2 q β2 + ⋯ + γℓ q βℓ

where β ≥2 is a base and ℓ ≥1 is the decomposition level. We assume βℓ∣q and take digits γi ∈{0,1,…,β −1}; under these conditions, the decomposition is unique. This is visually shown in Figure 1. (If βℓ ∤ q, see §A-6.3.) Each γi is a digit in the base-β representation of γ, where i = 1 is the most significant digit. When q is a power of two, this corresponds to a shift by i ⋅log⁡2β bits.

PIC

Figure 1: An illustration of number decomposition.

We define the decomposition of the number γ into base β with level ℓ as follows:

𝖣𝖾𝖼𝗈𝗆𝗉β,ℓ(γ) = (γ1,γ2, ⋯, γℓ).

Number decomposition is also called radix decomposition, where the base β is referred to as a radix.

A-6.1.1 Example

Suppose we take γ = 13 in ℤ16. Suppose we want to decompose 13 with the base β = 2 and level ℓ = 4. Then, 13 is decomposed as follows:

13 = 1 ⋅16 21 + 1 ⋅16 22 + 0 ⋅16 23 + 1 ⋅16 24

𝖣𝖾𝖼𝗈𝗆𝗉2,4(13) = (1,1,0,1)