On polynomials \(x^n-1\) over binary fields whose irreducible factors are binomials and trinomials

DOI10.1016/j.ffa.2021.101837zbMath1500.11089OpenAlexW3139299461MaRDI QIDQ2031633

Yanyan Li

Publication date: 10 June 2021

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2021.101837

zbMATH Keywords

trinomialsbinomialscyclotomic polynomialsbinary fields

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Arithmetic theory of polynomial rings over finite fields (11T55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Explicit factorization of \(x^n-1\in \mathbb {F}_q[x\)]
• Swan-like results for binomials and trinomials over finite fields of odd characteristic
• On explicit factors of cyclotomic polynomials over finite fields
• Factorization of polynomials over finite fields
• Factorization of trinomials over Galois fields of characteristic 2
• Factorization of the cyclotomic polynomial \(x^{2^n}+1\) over finite fields
• On the Chor-Rivest knapsack cryptosystem
• Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\)
• Explicit factorization of \(X^{2^m}p^n-1\) over a finite field

This page was built for publication: On polynomials \(x^n-1\) over binary fields whose irreducible factors are binomials and trinomials