Primitive polynomials testing methodology
N. Vijayarangan, R. Vijayasarathy · Journal of Discrete Mathematical Sciences and Cryptography · 2005
Primitive polynomials are essential for designing LFSRs for stream ciphers. This paper proposes a new methodology of testing if a given polynomial over GF(2 n ) is primitive or not. This method can be extended to any higher degree n of a polynomial and is fast and efficient.