1. Bailey, D.V., Paar, C.: Efficient arithmetic in finite field extensions with application in elliptic curve cryptography. Journal of Cryptology 14(3), 153–176 (2001)
2. Brent, R., Zimmermann, P.: Algorithms for finding almost irreducible and almost primitive trinomials. Primes and Misdemeanours: Lectures in Honour of the Sixtieth Birthday of Hugh Cowie Williams, The Fields Institute, Toronto, to be published by the American Mathematical Society. See, http://web.comlab.ox.ac.uk/oucl/work/richard.brent/pd/rpb212.pdf
3. Lecture Notes in Computer Science;R. Brent,2003
4. Doche, C.: A table of redundant trinomials in characteristic 2 up to the degree 10000. See, http://www.math.u-bordeaux.fr/~cdoche/documents/redundant.gp.gz
5. Frey, G.: Applications of arithmetical geometry to cryptographic constructions. In: Jungnickel, D., Niederreiter, H. (eds.) Fifth International Conference on Finite Fields and Applications, pp. 128–161. Springer, Berlin (2001)