Constructing irreducible polynomials over finite fields
We describe a new method for constructing irreducible polynomials modulo a prime number p. The method mainly relies on Chebotarev's density theorem.
Main Authors: | Ling, San, Ozdemir, Enver, Xing, Chaoping |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Journal Article |
Language: | English |
Published: |
2013
|
Online Access: | https://hdl.handle.net/10356/97307 http://hdl.handle.net/10220/10582 |
Similar Items
-
Irreducible polynomials over finite fields produced by composition of quadratics
by: Heath-Brown, DR, et al.
Published: (2019) -
An upper bound on the complexity of multiplication of polynomials modulo a power of an irreducible polynomial
by: Kaminski, Michael, et al.
Published: (2013) -
On the number of irreducible polynomials of special kinds in finite fields
by: Weihua Li, et al.
Published: (2020-04-01) -
Irreducible compositions of degree two polynomials over finite fields have regular structure
by: Ferraguti, A, et al.
Published: (2018) -
Irreducible skew polynomials over domains
by: Brown C., et al.
Published: (2021-11-01)