R. Berlekamp and E. , Bit-serial Reed - Solomon encoders, IEEE Transactions on Information Theory, vol.28, issue.6, p.28, 1982.
DOI : 10.1109/TIT.1982.1056591

W. Diffie and M. Hellman, New directions in cryptography, IEEE Transactions on Information Theory, vol.22, issue.6, pp.644-654, 1976.
DOI : 10.1109/TIT.1976.1055638
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.9720

H. Fan and Y. Dai, Fast bit-parallel GF(2 n ) multiplier for all trinomials, IEEE Trans. on Comp, vol.54, issue.4, pp.485-490, 2005.

H. Fan and A. Hasan, A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields, IEEE Transactions on Computers, vol.56, issue.2, pp.224-233, 2007.
DOI : 10.1109/TC.2007.19

S. Gao, Normal Basis Over Finite Field, 1993.

J. V. Gathen and J. Gerhard, Modern Computer Algebra, 1999.

P. Giorgi, C. Jeannerod, and G. Villard, On the complexity of polynomial matrix computations, Proceedings of the 2003 international symposium on Symbolic and algebraic computation , ISSAC '03, pp.135-142, 2003.
DOI : 10.1145/860854.860889

J. Guajardjo and C. Paar, Efficient algorithms for elliptic curve cryptosystems, Advances in Cryptology, Proceedings of Eurocrypt'97, pp.342-356, 1997.

J. Bajard, L. Imbert, and T. P. , Modular Number Systems: Beyond the Mersenne Family, Selected Area in Cryptography, proceedings of SAC2004, pp.159-169, 2004.
DOI : 10.1007/978-3-540-30564-4_11
URL : https://hal.archives-ouvertes.fr/lirmm-00109208

N. Koblitz, Elliptic curve cryptosystems, Mathematics of Computation, vol.48, issue.177, pp.203-209, 1987.
DOI : 10.1090/S0025-5718-1987-0866109-5

C. Koc and B. Sunar, Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields, IEEE Transactions on Computers, vol.47, issue.3, pp.353-356, 1998.
DOI : 10.1109/12.660172

C. Koc and B. Sunar, Mastrovito Multiplier for All Trinomials, IEEE Transaction on Computers, vol.48, issue.5, pp.522-52, 1999.

E. Mastrovito, VLSI architectures for computations in Galois fields, 1991.

V. Miller, Use of elliptic curves in cryptography Advances in Cryptology, proceeding's of CRYPTO'85, LNCS, vol.218, pp.417-426, 1986.

P. L. Montgomery, Modular multiplication without trial division, Mathematics of Computation, vol.44, issue.170, pp.519-521, 1985.
DOI : 10.1090/S0025-5718-1985-0777282-X

T. Mulders and A. Storjohann, On lattice reduction for polynomial matrices, Journal of Symbolic Computation, vol.35, issue.4, pp.377-401, 2003.
DOI : 10.1016/S0747-7171(02)00139-6

A. Schönhage, Fast multiplication of polynomials over fields of characteristic 2, Acta Informatica, vol.7, issue.4, pp.395-398, 1977.
DOI : 10.1007/BF00289470

G. Villard, Computing Popov and Hermite forms of polynomial matrices, Proceedings of the 1996 international symposium on Symbolic and algebraic computation , ISSAC '96, pp.250-258, 1996.
DOI : 10.1145/236869.237082