A recurrent construction of irreducible polynomials of fixed degree over finite fields

被引:0
|
作者
Gohar M. Kyureghyan
Melsik K. Kyureghyan
机构
[1] University of Rostock,
[2] Institute for Informatics and Automation Problems,undefined
关键词
Finite fields; Composition method; Irreducible polynomials; Order of polynomial; Minimal polynomial; Square root;
D O I
暂无
中图分类号
学科分类号
摘要
In this paper we consider in detail the composition of an irreducible polynomial with X2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$X^2$$\end{document} and suggest a recurrent construction of irreducible polynomials of fixed degree over finite fields of odd characteristics. More precisely, given an irreducible polynomial of degree n and order 2rt\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^rt$$\end{document} with t odd, the construction produces ordt(2)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ord_t(2)$$\end{document} irreducible polynomials of degree n and order t. The construction can be used for example to search irreducible polynomials with specific requirements on its coefficients.
引用
收藏
页码:163 / 171
页数:8
相关论文
共 50 条