Construction of primitive polynomials over finite fields

被引：0

作者：

Alizadeh, Mahmood ^{[1
]}

机构：

[1] Islamic Azad Univ, Dept Math, Ahvaz Branch, Ahvaz, Iran

来源：

JOURNAL OF ALGEBRA AND ITS APPLICATIONS | 2021年 / 20卷 / 05期

关键词：

Finite fields; primitive polynomials; polynomial composition method; IRREDUCIBLE POLYNOMIALS;

D O I：

10.1142/S021949882150078X

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In this paper, using the polynomial composition methods some computationally simple and explicit ways for constructing higher degrees primitive polynomials from a given primitive polynomial over F-q are given.

引用

页数：8

共 14 条

[1] Bach E., 1990, Annual review of computer science. Vol.4, P119
[2] A construction of primitive polynomials over finite fields
Cardell, Sara D.
Climent, Joan-Josep
[J]. LINEAR & MULTILINEAR ALGEBRA, 2017, 65 (12) : 2424 - 2431
[3] Primitive polynomials with first and second coefficients prescribed
Cohen, SD
Mills, D
[J]. FINITE FIELDS AND THEIR APPLICATIONS, 2003, 9 (03) : 334 - 350
[4] COHEN SD, 1969, PROC CAMB PHILOS S-M, V66, P335
[5] Coppersmith D., 1993, P 13 ANN INT CRYPT C, V773, P23
[6] Primitive polynomial with three coefficients prescribed
Fan, SQ
Han, WB
[J]. FINITE FIELDS AND THEIR APPLICATIONS, 2004, 10 (04) : 506 - 521
[7] Character sums over Galois rings and primitive polynomials over finite fields
Fan, SQ
Han, WB
[J]. FINITE FIELDS AND THEIR APPLICATIONS, 2004, 10 (01) : 36 - 52
[8] Golomb S. W., 1982, Shift Register Sequences
[9] Modified self-shrinking generator
Kanso, Ali
[J]. COMPUTERS & ELECTRICAL ENGINEERING, 2010, 36 (05) : 993 - 1001
[10] Recurrent methods for constructing irreducible polynomials over Fq of odd characteristics
Kyuregyan, MK
[J]. FINITE FIELDS AND THEIR APPLICATIONS, 2003, 9 (01) : 39 - 58

← 1 2 →