Constructing irreducible polynomials over finite fields

San Ling; Enver Ozdemir; Chaoping Xing

doi:10.1090/S0025-5718-2011-02567-6

Constructing irreducible polynomials over finite fields

San Ling^*, Enver Ozdemir, Chaoping Xing

^*Corresponding author for this work

Nanyang Technological University

Research output: Contribution to journal › Article › peer-review

2 Citations (Scopus)

Abstract

We describe a new method for constructing irreducible polynomials modulo a prime number p. The method mainly relies on Chebotarev's density theorem.

Original language	English
Pages (from-to)	1663-1668
Number of pages	6
Journal	Mathematics of Computation
Volume	81
Issue number	279
DOIs	https://doi.org/10.1090/S0025-5718-2011-02567-6
Publication status	Published - 2012
Externally published	Yes

Keywords

Finite fields
Hilbert class polynomials

Access to Document

10.1090/S0025-5718-2011-02567-6

Cite this

@article{3f743dca3a7845df9ab04ee6c9ef30d9,

title = "Constructing irreducible polynomials over finite fields",

abstract = "We describe a new method for constructing irreducible polynomials modulo a prime number p. The method mainly relies on Chebotarev's density theorem.",

keywords = "Finite fields, Hilbert class polynomials",

author = "San Ling and Enver Ozdemir and Chaoping Xing",

year = "2012",

doi = "10.1090/S0025-5718-2011-02567-6",

language = "English",

volume = "81",

pages = "1663--1668",

journal = "Mathematics of Computation",

issn = "0025-5718",

publisher = "American Mathematical Society",

number = "279",

}

TY - JOUR

T1 - Constructing irreducible polynomials over finite fields

AU - Ling, San

AU - Ozdemir, Enver

AU - Xing, Chaoping

PY - 2012

Y1 - 2012

N2 - We describe a new method for constructing irreducible polynomials modulo a prime number p. The method mainly relies on Chebotarev's density theorem.

AB - We describe a new method for constructing irreducible polynomials modulo a prime number p. The method mainly relies on Chebotarev's density theorem.

KW - Finite fields

KW - Hilbert class polynomials

UR - https://www.scopus.com/pages/publications/84870775753

U2 - 10.1090/S0025-5718-2011-02567-6

DO - 10.1090/S0025-5718-2011-02567-6

M3 - Article

AN - SCOPUS:84870775753

SN - 0025-5718

VL - 81

SP - 1663

EP - 1668

JO - Mathematics of Computation

JF - Mathematics of Computation

IS - 279

ER -

Constructing irreducible polynomials over finite fields

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this