This note combines two related papers. The first work [LS18] explains how the factorization pattern of cyclotomic rings modulo 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.
Let and . The factorization of modulo controls how much CRT structure is available in . 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 , write
such that , and
For ,
The paper also writes for the largest singular value of the Vandermonde matrix associated with the primitive -th roots of unity. We only need and for the splitting theorem below; appears in the later bounds showing that small elements are invertible.
The cyclotomic polynomial is fully splitting modulo if it factors into linear terms over :
where the are exactly the primitive roots of unity modulo , such that . Since is cyclic of order , this happens exactly when contains primitive roots of unity, namely
In this case the CRT decomposes
The following theorem describes the characteristics of cyclotomic polynomial ring splitting, and more specifically, in the partial splitting case.
Let
where and . If is prime, , and , then for the primitive roots of unity,
and each factor is irreducible over .
The condition means, there is a size multiplicative subgroup in , such that are primitive roots of unity, while means, there is no elements in that can split to in the directions defined by the prime factors of .
It is better to understand in the Frobenius endomorphism aspect of view.
Let be an ambient field containing and all the roots of . We use it only so that we can discuss roots of even when they do not lie in . The polynomials are still defined over , meaning their coefficients lie in ; we only evaluate them over . The -Frobenius map is
It fixes pointwise, since for every . For , its Frobenius orbit is defined as and the orbit length is the smallest such that .
If is a primitive root of unity, then the condition for orbit to end is equivalent to over the exponent. Hence the Frobenius orbit length of a primitive root is .
We then construct the minimal polynomial from a Frobenius orbit, which is irreducible over .
Let have Frobenius orbit length , then
is the minimal polynomial for over . In particular, is irreducible over and has coefficients in , and .
This product lies in as the -Frobenius map cyclically permutes the roots in the product, which means
and all the binomial terms are over satisfying , then each coefficient , therefore each .
Let satisfy . By prior discussion, as each coefficient over has . Hence, vanishes over the Frobenius orbit, so , and is the minimal polynomial for over .
A minimal polynomials over a field are irreducible, or otherwise contradicting the minimality of the degree. ∎
If is a root of unity, is a root of unity. The primitiveness is preserved, say is a primitive root of unity, then is a primitive root of unity.
With , for a primitive root of unity in , the Frobenius orbit has length . By , we know the roots of unity are over . Hence, for each primitive root of unity , we have
where , and is a primitive root of unity. Therefore, the long Frobenius orbit vanishes over that is irreducible over for all .
The choice of controls the splitting pattern: the ring has CRT slots, each tied to an extension field of degree over . The fully splitting case is when , where , namely , then
By CRT decomposition, evaluation at these roots gives the NTT isomorphism. Let , then
and multiplication in becomes coordinate-wise multiplication after applying the NTT. In the power-of-two case , this condition becomes , so has all of its roots in .
Let and let be the primitive roots of unity defined over complex field. The short-invertibility question in [LS18] is whether a nonzero short element of can vanish in one of the CRT coordinates induced by the above splitting. Suppose
where the are irreducible over , then
and is invertible when for every irreducible . Hence, non-invertibility means that lands in the kernel of at least one CRT projection, and [LS18] views such kernels as ideal lattices under the canonical embedding. For , the canonical embedding is the complex evaluation vector
| (4.1) |
and the embedding norm is
| (4.2) |
Let be the associated Vandermonde matrix
The parameter defined as
is the largest singular value of , which is used to compare coefficient size with embedding size:
| (4.3) |
where is the coefficient vector of .
We now construct the main result of [LS18] from the lower bound of embedding norm of an ideal lattice.
Consider , and the next result is immediate by lemma 4.10.4. First, itself is an additive subgroup of . Second, for any and , we have . Hence, is an ideal lattice.
Suppose splits modulo into distinct irreducible factors of degree . If is nonzero and for one irreducible factor , then
Since , then lemma 4.10.5 is immediate.
If a nonzero vanishes in one CRT coordinate, then lies in , and lemma 4.10.5 forces to be large. Thus any nonzero whose coefficient norm is below this lower bound cannot vanish in any CRT coordinate.
Under the partial-splitting setup
any nonzero satisfying either
or
is invertible in .
Informally, short nonzero elements do not wrap around to zero in any NTT coordinate.