Editing Primitive polynomial (field theory) (section)

===Pseudo-random bit generation===
Primitive polynomials over GF(2), the field with two elements, can be used for [[Pseudorandom number generator|pseudorandom bit generation]]. In fact, every [[linear-feedback shift register]] with maximum cycle length (which is {{nowrap|2<sup>''n''</sup> − 1}}, where ''n'' is the length of the linear-feedback shift register) may be built from a primitive polynomial.<ref>C. Paar, J. Pelzl - Understanding Cryptography: A Textbook for Students and Practitioners</ref>

In general, for a primitive polynomial of degree ''m'' over GF(2), this process will generate {{nowrap|2<sup>''m''</sup> − 1}} pseudo-random bits before repeating the same sequence.