Optimal extension fields for fast arithmetic in public-key algorithms, Lecture Notes in Computer Science, vol.1462, p.472, 1998. ,
DOI : 10.1007/BFb0055748
Bit-serial Reed - Solomon encoders, IEEE Transactions on Information Theory, vol.28, issue.6, p.28, 1982. ,
DOI : 10.1109/TIT.1982.1056591
A Course In Computational Algebraic Number Theory, volume GTM 138, 1993. ,
GF(2/sup m/) multiplication and division over the dual basis, IEEE Transactions on Computers, vol.45, issue.3, pp.319-327, 1996. ,
DOI : 10.1109/12.485570
Abelian Groups, Gauss Periods, and Normal Bases, Finite Fields and Their Applications, vol.7, issue.1, 2001. ,
DOI : 10.1006/ffta.2000.0304
URL : http://doi.org/10.1006/ffta.2000.0304
Gauss periods and fast exponentiation in finite fields, Lecture Notes in Computer Science, vol.911, pp.311-322, 1995. ,
DOI : 10.1007/3-540-59175-3_98
Optimal normal bases, Designs, Codes and Cryptography, vol.22, issue.4, pp.315-323, 1992. ,
DOI : 10.1007/BF00125200
Density of normal elements. Finite Fields and Their Applications, pp.141-150, 1997. ,
New Low-Complexity Bit-Parallel Finite Field Multipliers Using Weakly Dual Bases, IEEE Trans. Computers, p.47, 1998. ,
Mastrovito multiplier for general irreducible polynomials, IEEE Transactions on Computers, vol.49, issue.5, pp.503-518, 2000. ,
DOI : 10.1109/12.859542
A modified Massey-Omura parallel multiplier for a class of finite fields, IEEE Transactions on Computers, vol.42, issue.10, pp.1278-1280, 1993. ,
DOI : 10.1109/12.257715
A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases, Information and Computation, vol.78, issue.3, pp.171-177, 1988. ,
DOI : 10.1016/0890-5401(88)90024-7
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
An Efficient Optimal Normal Basis Type II Multiplier, IEEE Trans. Computers, p.50, 2001. ,
A New Aspect of Dual Basis for Efficient Field Arithmetic, Proceedings of the Second International Workshop on Practice and Theory in Public Key Cryptography, pp.12-28, 1999. ,
DOI : 10.1007/3-540-49162-7_2
Computational Method and Apparatus for Finite Field Arithmetic, 1986. ,
VLSI architectures for computations in Galois fields, 1991. ,
Optimal normal bases in GF(pn), Discrete Applied Mathematics, vol.22, issue.2, pp.149-161, 1989. ,
DOI : 10.1016/0166-218X(88)90090-X
A new construction of Massey-Omura parallel multiplier over GF(2/sup m/), IEEE Transactions on Computers, vol.51, issue.5, pp.511-520, 2002. ,
DOI : 10.1109/TC.2002.1004590
Parallel multipliers based on special irreducible pentanomials, IEEE Transactions on Computers, vol.52, issue.12, 2003. ,
DOI : 10.1109/TC.2003.1252850
Low complexity multiplication in rings ,
Mastrovito multiplier for all trinomials, IEEE Transactions on Computers, vol.48, issue.5, 1999. ,
DOI : 10.1109/12.769434