R. P. Brent, Search for primitive trinomials, 2008.

R. Brent, P. Gaudry, E. Thomé, and P. Zimmermann, Faster Multiplication in GF(2)[x], Proc. of the 8th International Symposium on Algorithmic Number Theory (ANTS VIII), pp.153-166, 2008.
DOI : 10.1007/978-3-540-79456-1_10

URL : https://hal.archives-ouvertes.fr/inria-00188261

R. P. Brent, S. Larvala, and P. Zimmermann, A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377, Mathematics of Computation, vol.72, issue.243, pp.1443-1452, 2003.
DOI : 10.1090/S0025-5718-02-01478-3

URL : https://hal.archives-ouvertes.fr/inria-00099744

R. Brent and P. Zimmermann, A multi-level blocking distinct-degree factorization algorithm, Contemporary Mathematics Math. Comp. Notices of the AMS, vol.461, issue.58, pp.47-58, 2008.
DOI : 10.1090/conm/461/08982

URL : https://hal.archives-ouvertes.fr/inria-00187614

Y. Kurita and M. Matsumoto, Primitive t-Nomials (t = 3, 5) Over GF(2) Whose Degree is a Mersenne Exponent ???44497, Mathematics of Computation, vol.56, issue.194, pp.817-821, 1991.
DOI : 10.2307/2008411

V. Shoup, NTL: A library for doing number theory, 2016.

R. G. Swan, Factorization of polynomials over finite fields, Pacific Journal of Mathematics, vol.12, issue.3, pp.1099-1106, 1962.
DOI : 10.2140/pjm.1962.12.1099