A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 (Q4806397)

From MaRDI portal
Revision as of 16:21, 5 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1910551
Language Label Description Also known as
English
A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377
scientific article; zbMATH DE number 1910551

    Statements

    A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 (English)
    0 references
    0 references
    0 references
    0 references
    14 May 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    irreducible polynomials
    0 references
    irreducible trinomials
    0 references
    primitive polynomials
    0 references
    primitive trinomials
    0 references
    Mersenne exponents
    0 references
    Mersenne numbers
    0 references
    random number generators
    0 references
    0 references