A NOTE ON N-POLYNOMIALS OVER FINITE FIELDS

被引：0

作者：

Kim, Kitae ^{[1
]}

Yie, Ikkwon ^{[1
]}

机构：

[1] Inha Univ, Dept Math, Incheon, South Korea

来源：

KOREAN JOURNAL OF MATHEMATICS | 2020年 / 28卷 / 03期

基金：

新加坡国家研究基金会;

关键词：

Normal basis; N-polynomial; Cohen transformation; Q-transormation; IRREDUCIBLE POLYNOMIALS;

D O I：

10.11568/kjm.2020.28.3.639

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A simple type of Cohen's transformation consists of a polynomial and a linear fractional transformation. We study the effectiveness of Cohen transformation to find N-polynomials over finite fields.

引用

页码：639 / 647

页数：9

共 14 条

[1]

[Anonymous], 1942, Duke Math. J.

[2] On the reducibility of some composite polynomials over finite fields [J].

Cao, Xiwang ;

Hu, Lei .

DESIGNS CODES AND CRYPTOGRAPHY, 2012, 64 (03) :229-239

[3]

Cohen S. D., 1993, DESIGN CODE CRYPTOGR, V2, P169

[4]

Gao S., 1993, THESIS

[5]

Garefalskis, 2011, J PURE APPL ALGEBRA, V215, P159

[6] TRACE-ORTHOGONAL NORMAL BASES [J].

JUNGNICKEL, D .

DISCRETE APPLIED MATHEMATICS, 1993, 47 (03) :233-249

[7] Groups of permutations generated by function-linear translator pairs [J].

Kim, K. ;

Namgoong, J. ;

Yie, I. .

FINITE FIELDS AND THEIR APPLICATIONS, 2017, 45 :170-182

[8] Iterated constructions of irreducible polynomials over finite fields with linearly independent roots [J].

Kyuregyan, MK .

FINITE FIELDS AND THEIR APPLICATIONS, 2004, 10 (03) :323-341

[9] Recurrent methods for constructing irreducible polynomials over GF(2s) [J].

Kyuregyan, MK .

FINITE FIELDS AND THEIR APPLICATIONS, 2002, 8 (01) :52-68

[10]

Lempel A., 1988, SIAM J DISCRETE MATH, V1, P758

← 1 2 →