论文信息 - Search of primitive polynomials over finite fields

Search of primitive polynomials over finite fields

Abstract 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.

Marc Rybowicz | M. Rybowicz

[1] Donald Ervin Knuth,et al. The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .

[2] Abraham Lempel. Analysis and synthesis of polynomials and sequences over GF(2) , 1971, IEEE Trans. Inf. Theory.

[3] Paul Camion. Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials , 1983, IEEE Trans. Inf. Theory.

[4] Ronald L. Rivest,et al. A knapsack-type public key cryptosystem based on arithmetic in finite fields , 1988, IEEE Trans. Inf. Theory.

[5] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[6] Jacob T. B. Beard. Computing in ${\rm GF}\,(q)$ , 1974 .

[7] P. Ribenboim. The Book of Prime Number Records , 1988 .

[8] L. Fox,et al. Chebyshev polynomials in numerical analysis , 1970 .

[9] D. Shanks. Solved and Unsolved Problems in Number Theory , 1964 .

[10] Rudolf Lide,et al. Finite fields , 1983 .

[11] L. Carlitz,et al. Primitive roots in a finite field , 1952 .

[12] Jacob T. B. Beard,et al. Computing in GF(q) , 1974 .

[13] Construction of Galois fields of characteristic two and irreducible polynomials , 1960 .