4.10 Short Invertible Polynomial Ring Elements

This note combines two related papers. The first work [LS18] explains how the factorization pattern of cyclotomic rings modulo q affects the availability of short invertible elements, which is for the challenge spaces in Fiat-Shamir with Abort sigma protocol. The second work [BLS19] uses the fully splitting case to turn a coordinate-wise shortness statement into an algebraic identity via the NTT.

Cyclotomic Polynomial Ring Splitting.

Let R=ℤ⁢[X]/(Φℓ⁢(X)) and Rq=ℤq⁢[X]/(Φℓ⁢(X)). The factorization of Φℓ modulo q controls how much CRT structure is available in Rq. If Φℓ splits into a few irreducible factors, one obtains a partially splitting ring. This is useful for fast multiplication and for constructing large challenge sets whose nonzero differences remain invertible [LS18].

For an integer m>1, write

φ⁢(m)=m⋅∏p⁢ primep∣mp−1p,δ⁢(m)=∏p⁢ primep∣mp,

such that m=φ⁢(m)/φ⁢(δ⁢(m))×δ⁢(m), and

τ⁢(m)={m,m⁢ is odd,m/2,m⁢ is even.

For a∈ℤm∗,

𝗈𝗋𝖽m⁢(a)=min⁡{k>0:ak≡1modm}.

The paper also writes s1⁢(m) for the largest singular value of the Vandermonde matrix associated with the primitive m-th roots of unity. We only need φ and 𝗈𝗋𝖽 for the splitting theorem below; s1 appears in the later bounds showing that small elements are invertible.

The cyclotomic polynomial Φm is fully splitting modulo q if it factors into linear terms over ℤq:

Φm⁢(X)≡∏j∈[1,φ⁢(m)](X−rj)modq,

where the rj∈ℤq∗ are exactly the primitive mth roots of unity modulo q, such that 𝗈𝗋𝖽q⁢(rj)=φ⁢(m). Since ℤq∗ is cyclic of order q−1, this happens exactly when ℤq contains primitive mth roots of unity, namely

m∣q−1⇔q≡1modm.

In this case the CRT decomposes

ℤq⁢[X]/(Φm⁢(X))≅∏j∈[1,φ⁢(m)]ℤq⁢[X]/(X−rj)≅ℤqφ⁢(m).

The following theorem describes the characteristics of cyclotomic polynomial ring splitting, and more specifically, in the partial splitting case.

Theorem 4.10.1 (Cyclotomic Partial Splitting [LS18]).

Let

m=∏ipiei,z=∏ipifi,

where ei≥1 and 1≤fi≤ei. If q is prime, q≡1modz, and 𝗈𝗋𝖽m⁢(q)=m/z, then for rj the primitive zth roots of unity,

Φm⁢(X)≡∏j∈[1,φ⁢(z)](Xm/z−rj)modq

and each factor Xm/z−rj is irreducible over ℤq.

The condition q≡1modz means, there is a size z multiplicative subgroup in ℤq∗, such that rj are zth primitive roots of unity, while 𝗈𝗋𝖽m⁢(q)=m/z means, there is no elements in ℤq∗ that rj can split to in the directions defined by the prime factors of m/z.

It is better to understand 𝗈𝗋𝖽m⁢(q) in the Frobenius endomorphism aspect of view.

Definition 4.10.2 (Frobenius endomorphism and orbit).

Let ℤq‾ be an ambient field containing ℤq and all the roots of Φm⁢(X). We use it only so that we can discuss roots of Φm even when they do not lie in ℤq. The polynomials are still defined over ℤq, meaning their coefficients lie in ℤq; we only evaluate them over ℤ‾q. The q-Frobenius map is

𝖤𝗇𝖽𝗈q⁢(α)=αq.

It fixes ℤq pointwise, since aq=a for every a∈ℤq. For α∈ℤq‾, its Frobenius orbit is defined as α,αq,αq2,… and the orbit length is the smallest t>0 such that αqt=α.

If α is a primitive mth root of unity, then the condition αqt=α for orbit to end is equivalent to qt≡1modm over the exponent. Hence the Frobenius orbit length of a primitive mth root is 𝗈𝗋𝖽m⁢(q).

We then construct the minimal polynomial from a Frobenius orbit, which is irreducible over ℤq.

Lemma 4.10.3 (Minimal polynomial from Frobenius orbit).

Let α∈ℤq‾ have Frobenius orbit length t, then

μα⁢(X)=∏i∈[0,t−1](X−αqi)

is the minimal polynomial for α over ℤq. In particular, μα⁢(X) is irreducible over ℤq and has coefficients in ℤq, and deg⁡(μα)=t.

Proof.

This product lies in ℤq⁢[X] as the q-Frobenius map cyclically permutes the roots in the product, which means

∏i∈[0,t−1](X−(αqi)q)=∏i∈[1,t](X−αqi)=μα⁢(X),

and all the binomial terms are over Zq satisfying b=bq, then each coefficient cq=c, therefore each c∈ℤq.

Let g⁢(X)∈ℤq⁢[X] satisfy g⁢(α)=0. By prior discussion, g⁢(αq)=0 as each coefficient over ℤq has c=cq. Hence, g⁢(X) vanishes over the Frobenius orbit, so μα|g, and μg is the minimal polynomial for α over ℤq.

A minimal polynomials over a field are irreducible, or otherwise contradicting the minimality of the degree. ∎

If ζ is a mth root of unity, ζm/z is a zth root of unity. The primitiveness is preserved, say ζ is a primitive mth root of unity, then ζm/z is a primitive zth root of unity.

With 𝗈𝗋𝖽m⁢(q)=m/z, for a primitive mth root of unity in ℤ‾q, the Frobenius orbit has length m/z. By q≡1modz, we know the zth roots of unity are over ℤq. Hence, for each primitive mth root of unity ζ, we have

(ζqi)m/z=(ζm/z)qi=rqi=r,

where ζm/z=r, and r is a primitive zth root of unity. Therefore, the m/z long Frobenius orbit vanishes over Xm/z−rj that is irreducible over ℤq for all j∈[1,φ⁢(z)].

The choice of z controls the splitting pattern: the ring has φ⁢(z) CRT slots, each tied to an extension field of degree m/z over ℤq. The fully splitting case is when z=m, where 𝗈𝗋𝖽m⁢(q)=1, namely q≡1modm, then

Φm⁢(X)≡∏j∈[1,φ⁢(m)](X−rj)modq.

By CRT decomposition, evaluation at these roots gives the NTT isomorphism. Let n=φ⁢(m), then

Rq≅ℤqn,s↦s^=(s⁢(r1),…,s⁢(rn)),

and multiplication in Rq becomes coordinate-wise multiplication after applying the NTT. In the power-of-two case R=ℤ⁢[X]/(Xn+1)=ℤ⁢[X]/(Φ2⁢n⁢(X)), this condition becomes q≡1mod2⁢n, so Xn+1 has all of its roots in ℤq.

Splitting and Short Invertability.

Let Rm=ℤ⁢[X]/(Φm⁢(X)) and let ω1,…,ωφ⁢(m) be the primitive mth roots of unity defined over complex field. The short-invertibility question in [LS18] is whether a nonzero short element of Rm,q can vanish in one of the CRT coordinates induced by the above splitting. Suppose

Φm⁢(X)≡∏jfj⁢(X)modq,

where the fj are irreducible over ℤq, then

Rm,q≅∏jℤq⁢[X]/(fj⁢(X)),

and y∈Rm,q is invertible when y≢0modfj⁢(X) for every irreducible fj. Hence, non-invertibility means that y lands in the kernel of at least one CRT projection, and [LS18] views such kernels as ideal lattices under the canonical embedding. For 𝐲=∑i∈[0,φ⁢(m)−1]yi⁢Xi∈Rm, the canonical embedding is the complex evaluation vector

σ⁢(𝐲)=(𝐲⁢(ω1),…,𝐲⁢(ωφ⁢(m)))∈ℂφ⁢(m), (4.1)

and the embedding norm is

‖𝐲‖e=‖σ⁢(𝐲)‖2. (4.2)

Let Vm be the associated Vandermonde matrix

𝐕m=(1ω1⋯ω1φ⁢(m)−1⋮⋮⋮1ωφ⁢(m)⋯ωφ⁢(m)φ⁢(m)−1).

The parameter s1⁢(m) defined as

s1⁢(m)=max𝐮∈ℂφ⁢(m)∖{0}⁡‖Vm⁢𝐮‖2‖𝐮‖2

is the largest singular value of Vm, which is used to compare coefficient size with embedding size:

‖𝐲‖e=‖𝐕m⁢𝐲‖2≤s1⁢(m)⁢‖𝐲‖2, (4.3)

where 𝐲=(y0,…,yφ⁢(m)−1) is the coefficient vector of 𝐲.

We now construct the main result of [LS18] from the lower bound of embedding norm of an ideal lattice.

Lemma 4.10.4 (Embedding lower bound for ideal lattices [PR07, LS18]).

Let Λ be an ideal lattice in Rm, for every nonzero 𝐲∈Λ satisfies

‖𝐲‖e≥φ⁢(m)⋅det(Λ)1/φ⁢(m).

Applying eq. 4.3, we get

‖𝐲‖2≥λ1⁢(Λ)≥φ⁢(m)s1⁢(m)⋅det(Λ)1/φ⁢(m).

Consider Λ={𝐱∈Rm:𝐱≡0mod(fi,q)}, and the next result is immediate by lemma 4.10.4. First, Λ itself is an additive subgroup of ℤφ⁢(m). Second, for any a∈Λ and b∈Rm, we have a⁢b∈Λ. Hence, Λ is an ideal lattice.

Lemma 4.10.5 (Polynomial ring ℓ2 lower bound [LS18]).

Suppose Φm⁢(X) splits modulo q into d distinct irreducible factors of degree φ⁢(m)/d. If 𝐲∈Rm is nonzero and 𝐲≡0mod(fj⁢(X),q) for one irreducible factor fj, then

‖𝐲‖2≥φ⁢(m)s1⁢(m)⁢q1/d.

Since det(Λ)=|ℤφ⁢(m)/Λ|=qφ⁢(m)/d, then lemma 4.10.5 is immediate.

If a nonzero 𝐲 vanishes in one CRT coordinate, then 𝐲 lies in Λ, and lemma 4.10.5 forces ‖𝐲‖2 to be large. Thus any nonzero 𝐲 whose coefficient norm is below this lower bound cannot vanish in any CRT coordinate.

Theorem 4.10.6 (Short invertibility in partially splitting rings [LS18]).

Under the partial-splitting setup

Φm⁢(X)≡∏j∈[1,φ⁢(z)](Xm/z−rj)modq,

any nonzero 𝐲∈Rm,q satisfying either

‖𝐲‖∞<1s1⁢(z)⁢q1/φ⁢(z)

or

‖𝐲‖2<φ⁢(m)s1⁢(m)⁢q1/φ⁢(z)

is invertible in Rm,q.

Informally, short nonzero elements do not wrap around to zero in any NTT coordinate.