Search of primitive polynomials over finite fields (Q749611): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / reviewed by
 
Property / reviewed by: Q749610 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Joseph J. Liang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4184967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing in GF(q) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitive Roots in a Finite Field / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft) / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5531597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5533821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis and synthesis of polynomials and sequences over<tex>GF(2)</tex> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5690468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3726006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: All Factors q < 10 8 in All Mersenne Numbers 2 p - 1, p Prime < 10 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4180420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of Galois Fields of Characteristic Two and Irreducible Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3919800 / rank
 
Normal rank

Latest revision as of 11:20, 21 June 2024

scientific article
Language Label Description Also known as
English
Search of primitive polynomials over finite fields
scientific article

    Statements

    Search of primitive polynomials over finite fields (English)
    0 references
    0 references
    1990
    0 references
    A certain class of irreducible polynomials over GF(2) is introduced which turn out to be mostly primitive. Those which are not primitive seem to have orders of a special form. The author also presents an algorithm without proof to construct primitive elements of some extensions over GF(2).
    0 references
    primitive polynomials over finite fields
    0 references

    Identifiers