The following pages link to On primitive trinomials (Mod 2) (Q5549897):
Displaying 16 items.
- Efficient hardware implementation of finite fields with applications to cryptography (Q850794) (← links)
- Irreducible factors of psi-polynomials over finite fields (Q1111610) (← links)
- Algebraic theory of block codes detecting independent errors (Q1132060) (← links)
- A universal GFSR random number generator for personal computers (Q1359814) (← links)
- A comparative study of some pseudorandom number generators (Q1359858) (← links)
- Clues to the hidden nature of de Bruijn sequences (Q1570092) (← links)
- Characterizations of generators for modified de Bruijn sequences (Q1802351) (← links)
- Primitive polynomials testing methodology (Q3379153) (← links)
- Generating Uniformly Distributed Random Numbers without Floating Point Operations (Q3416039) (← links)
- Primitive Polynomials Over Finite Fields (Q4032170) (← links)
- On the Use of Reducible Polynomials as Random Number Generators (Q4293976) (← links)
- On the Periods of Generalized Fibonacci Recurrences (Q4305958) (← links)
- Gauss periods: orders and cryptographical applications (Q4372701) (← links)
- Primitive Binary Polynomials (Q4404996) (← links)
- A construction of primitive polynomials over finite fields (Q4603778) (← links)
- Maximally equidistributed combined Tausworthe generators (Q4878542) (← links)
