“…The study of the coefficients of the cyclotomic polynomials has a very long history, which goes back at least to Gauss. For a survey, see [20]. Let A(n) be the maximum of the absolute values of a n (0), .…”
We prove that the Ring Learning With Errors (RLWE) and the Polynomial Learning With Errors (PLWE) problems over the cyclotomic field Q(ζn) are not equivalent. Precisely, we show that reducing one problem to the other increases the noise by a factor that is more than polynomial in n. We do so by providing a lower bound, holding for infinitely many positive integers n, for the condition number of the Vandermonde matrix of the nth cyclotomic polynomial.
“…The study of the coefficients of the cyclotomic polynomials has a very long history, which goes back at least to Gauss. For a survey, see [20]. Let A(n) be the maximum of the absolute values of a n (0), .…”
We prove that the Ring Learning With Errors (RLWE) and the Polynomial Learning With Errors (PLWE) problems over the cyclotomic field Q(ζn) are not equivalent. Precisely, we show that reducing one problem to the other increases the noise by a factor that is more than polynomial in n. We do so by providing a lower bound, holding for infinitely many positive integers n, for the condition number of the Vandermonde matrix of the nth cyclotomic polynomial.
“…The coefficients of cyclotomic polynomials have been intensively studied; we refer to [20] for a recent survey. The following lemma lists some basic properties of cyclotomic polynomials.…”
Section: Cyclotomic Polynomialsmentioning
confidence: 99%
“…(2) Let G = Z n and let k be a divisor of n such that 5,6,7,8,9,12,13,14,15,16,17,20,22,24,26,28,31,32,33,34,35,36,39,40,41,42,43,46,47…”
Given a finite abelian group G and a subset J ⊂ G with 0 ∈ J, let D G (J, N ) be the maximum size of A ⊂ G N such that the difference set A − A and J N have no non-trivial intersection. Recently, this extremal problem has been widely studied for different groups G and subsets J. In this paper, we generalize and improve the relevant results by Alon and by Hegedűs by building a bridge between this problem and cyclotomic polynomials. In particular, we construct infinitely many non-trivial families of G and J for which the upper bounds on D G (J, N ) obtained by them (via linear algebra method) can be improved exponentially. We also obtain a new upper bound D Fp ({0, 1}, N ) ≤ ( 1 2 + o( 1))(p − 1) N , which improves the previously best known result by Huang, Klurman and Pohoata. Our main tools are from algebra, number theory, and probability.
“…Due to its importance in many branches of mathematics, there have been extensive investigation on its properties. Recently, Sanna in [20], write a concise survey and attempts to collect the main results regarding the coefficients of the cyclotomic polynomials and to provide all the relevant references to their proofs.…”
We study the number of non-zero terms in two specific families of ternary cyclotomic polynomials. We find formulas for the number of terms by writing the cyclotomic polynomial as a sum of smaller sub-polynomials and study the properties of these polynomials. 2020 Mathematics Subject Classification. 11B83.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.