Explicit factorization of $x^n-1\in \mathbb F_q[x]$
F.E. Brochero Mart\'inez, C. R. Giraldo Vergara, L. Batista de, Oliveira

TL;DR
This paper provides explicit factorizations of the polynomial x^n - 1 over finite fields into irreducible binomials and certain trinomials, under specific conditions on q and n, enhancing understanding of polynomial structure in finite fields.
Contribution
It introduces explicit factorizations of x^n - 1 into irreducible binomials and trinomials under certain conditions, extending previous results on polynomial factorization over finite fields.
Findings
Explicit factorization into irreducible binomials x^t - a.
Extension to factors of the form x^{2t} - a x^t + b.
Conditions on q and n for the factorizations to hold.
Abstract
Let be a finite field and a positive integer. In this article, we prove that, under some conditions on and , the polynomial can be split into irreducible binomials and an explicit factorization into irreducible factors is given. Finally, weakening one of our hypothesis, we also obtain factors of the form and explicit splitting of into irreducible factors is given.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Islamic Finance and Communication · Cryptography and Residue Arithmetic
