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

DOI10.1090/S0025-5718-02-01478-3zbMATH Open1119.11320DBLPjournals/moc/BrentLZ03OpenAlexW2079168443WikidataQ56939042 ScholiaQ56939042MaRDI QIDQ4806397FDOQ4806397

Authors: Richard P. Brent, Samuli Larvala, Paul Zimmermann 

Publication date: 14 May 2003

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-02-01478-3

Recommendations

• Ten new primitive binary trinomials
• Primitive t-Nomials (t = 3, 5) Over GF(2) Whose Degree is a Mersenne Exponent 44497
• A primitive trinomial of degree 6972593
• New primitive $t$-nomials $(t = 3,5)$ over $GF(2)$ whose degree is a Mersenne exponent
• scientific article; zbMATH DE number 872088

zbMATH Keywords

primitive polynomialsirreducible polynomialsMersenne numbersrandom number generatorsirreducible trinomialsMersenne exponentsprimitive trinomials

Mathematics Subject Classification ID

Special sequences and polynomials (11B83) Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16)

Cites Work

• Title not available (Why is that?)
• Algebraic coding theory
• Title not available (Why is that?)
• Primitive Normal Bases for Finite Fields
• Factorization of polynomials over finite fields
• Title not available (Why is that?)
• Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
• Primitive Binary Polynomials
• Title not available (Why is that?)
• On xn + x + 1 over GF(2)
• Primitive trinomials whose degree is a Mersenne exponent
• On the Theorem of Gleason and Marsh
• Primitive t-Nomials (t = 3, 5) Over GF(2) Whose Degree is a Mersenne Exponent 44497
• Primitive Polynomials (Mod 2)
• NEW PRIMITIVE TRINOMIALS OF MERSENNE-EXPONENT DEGREES FOR RANDOM-NUMBER GENERATION
• Primitive Trinomials of High Degree
• Title not available (Why is that?)
• Title not available (Why is that?)
• On trinomials xn + x}2 + 1 and x8/ ± 3 + xk + 1 irreducible over GF(2)
• New primitive $t$-nomials $(t = 3,5)$ over $GF(2)$ whose degree is a Mersenne exponent

Cited In (8)

• On Mersenne polynomials over \(\mathbb{F}_2\)
• Algorithms for Finding Almost Irreducible and Almost Primitive Trinomials
• Primitive t-Nomials (t = 3, 5) Over GF(2) Whose Degree is a Mersenne Exponent 44497
• A primitive trinomial of degree 6972593
• A polynomial variant of perfect numbers
• NEW PRIMITIVE TRINOMIALS OF MERSENNE-EXPONENT DEGREES FOR RANDOM-NUMBER GENERATION
• Ten new primitive binary trinomials
• Computing special powers in finite fields

This page was built for publication: A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4806397)