SEARCH OF PRIMITIVE POLYNOMIALS OVER FINITE-FIELDS

被引:4
|
作者
RYBOWICZ, M
机构
[1] Département de Mathématiques, Université de Limoges
关键词
D O I
10.1016/0022-4049(90)90115-X
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We give a conjectural deterministic algorithm for computing primitive elements of extensions of GF(2) and some experimental results. We use both modular reductions of polynomials with integer coefficients and a method by Varshamov and Gamkrelidze which allows to build a primitive polynomial from a polynomial of lower order. © 1990.
引用
收藏
页码:139 / 151
页数:13
相关论文
共 50 条