On primitive trinomials (mod 2), II

DOI10.1016/S0019-9958(69)90356-8zbMath0184.07705OpenAlexW4213346643MaRDI QIDQ5575685

Neal Zierler, John Brillhart

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)90356-8

zbMATH Keywords

number theory

Mathematics Subject Classification ID

Polynomials (irreducibility, etc.) (11R09)

Related Items (13)

Efficient hardware implementation of finite fields with applications to cryptography ⋮ A universal GFSR random number generator for personal computers ⋮ Irreducible factors of psi-polynomials over finite fields ⋮ A very fast shift-register sequence random number generator ⋮ Random number generation with the recursion \(X_ t=X_{t-3p}\oplus X_{t-3q}\) ⋮ Irreducible trinomials over finite fields ⋮ Gauss periods: orders and cryptographical applications ⋮ An analog to the discriminant over fields of characteristic two ⋮ Primitive Polynomials Over Finite Fields ⋮ Primitive polynomials testing methodology ⋮ Factorization of trinomials over Galois fields of characteristic 2 ⋮ Maximum-length sequences, cellular automata, and random numbers ⋮ Generating Uniformly Distributed Random Numbers without Floating Point Operations

This page was built for publication: On primitive trinomials (mod 2), II