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

DOI10.1090/S0025-5718-02-01478-3zbMath1119.11320DBLPjournals/moc/BrentLZ03OpenAlexW2079168443WikidataQ56939042 ScholiaQ56939042MaRDI QIDQ4806397

Samuli Larvala, Paul Zimmermann, Richard P. Brent

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

zbMATH Keywords

random number generatorsirreducible polynomialsMersenne numbersprimitive polynomialsirreducible trinomialsMersenne exponentsprimitive trinomials

Mathematics Subject Classification ID

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

Related Items (5)

Computing special powers in finite fields ⋮ A primitive trinomial of degree 6972593 ⋮ Ten new primitive binary trinomials ⋮ Unnamed Item ⋮ On Mersenne polynomials over \(\mathbb{F}_2\)

Cites Work

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

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