Primitive trinomials whose degree is a Mersenne exponent

DOI10.1016/S0019-9958(69)90631-7MaRDI QIDQ5580403zbMATH OpenFDO

Authors Neal Zierler

Publication date 1969

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(69)90631-7

zbMATH Keywords

number theory

Cited in

(9)

• A special-purpose processor for the Monte Carlo simulation of Ising spin systems
• A fast processor for Monte-Carlo simulation
• Irreducible factors of psi-polynomials over finite fields
• A universal GFSR random number generator for personal computers
• A comparative study of some pseudorandom number generators
• On the Use of Reducible Polynomials as Random Number Generators
• On the Periods of Generalized Fibonacci Recurrences
• A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377
• Reduction-free multiplication for finite fields and polynomial rings

This page was built for publication: Primitive trinomials whose degree is a Mersenne exponent

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