The Euclidean Algorithm and Primitive Polynomials over Finite Fields

1999 ◽  
pp. 482-491 ◽  
Author(s):  
James W. Bond ◽  
Stefen Hui ◽  
Hank Schmidt
Keyword(s):  
Finite Fields ◽  
Euclidean Algorithm ◽  
Primitive Polynomials ◽  
Polynomials Over Finite Fields

Some primitive polynomials over finite fields

2001 ◽  
Vol 21 (3) ◽  
pp. 412-416 ◽  
Author(s):  
Seunghwan Chang ◽  
June Bok Lee
Keyword(s):  
Finite Fields ◽  
Primitive Polynomials ◽  
Polynomials Over Finite Fields

scholarly journals On the number of primitive polynomials over finite fields

2005 ◽  
Vol 11 (1) ◽  
pp. 156-163 ◽  
Author(s):  
Yaotsu Chang ◽  
Wun-Seng Chou ◽  
Peter J.-S. Shiue
Keyword(s):  
Finite Fields ◽  
Primitive Polynomials ◽  
Polynomials Over Finite Fields

scholarly journals On primitive polynomials over finite fields

1989 ◽  
Vol 124 (2) ◽  
pp. 337-353 ◽  
Author(s):  
Dieter Jungnickel ◽  
Scott A Vanstone
Keyword(s):  
Finite Fields ◽  
Primitive Polynomials ◽  
Polynomials Over Finite Fields

How to securely outsource the extended euclidean algorithm for large-scale polynomials over finite fields

2020 ◽  
Vol 512 ◽  
pp. 641-660 ◽  
Author(s):  
Qiang Zhou ◽  
Chengliang Tian ◽  
Hanlin Zhang ◽  
Jia Yu ◽  
Fengjun Li
Keyword(s):  
Finite Fields ◽  
Large Scale ◽  
Euclidean Algorithm ◽  
Extended Euclidean Algorithm ◽  
Polynomials Over Finite Fields

Construction of primitive polynomials over finite fields

2020 ◽  
pp. 2150078
Author(s):  
Mahmood Alizadeh
Keyword(s):  
Finite Fields ◽  
Primitive Polynomial ◽  
Composition Methods ◽  
Primitive Polynomials ◽  
Polynomial Composition ◽  
Polynomials Over Finite Fields

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 [Formula: see text] are given.

Sign in / Sign up

Export Citation Format

Share Document