Hardware implementations of GF (2m) arithmetic using normal basis

Journal of Applied Sciences

Volumn 6, Issue 6, 2006, Pages 1362-1372

  Al Somani, Turki F ^a   Amin, Alaaeldin ^a  

^a KING FAHD UNIVERSITY OF PETROLEUM AND MINERALS   (Saudi Arabia)

Author keywords

Inversion; Multiplication; Normal basis

Indexed keywords

TECHNOLOGY;

FIELD OPERATION; HARDWARE COMPLEXITY; HARDWARE IMPLEMENTATIONS; INVERSION; ITOH-TSUJII INVERSION ALGORITHMS; MULTIPLICATION; NORMAL BASIS; TIME COMPLEXITY;

HARDWARE;

EID: 41949140589     PISSN: 18125654     EISSN: 18125662     Source Type: Journal    
DOI: 10.3923/jas.2006.1362.1372     Document Type: Article

References (22)

1. m). IEEE Trans. Computers, 38: 1383-1386.
2. m). Electronics Lett., 32: 17.
3. Gao, S. and S. Vanstone, 1995. On orders of optimal normal basis generatons. Math. Computation, 64: 1227-1233.
4. m). In Proceedings of 13th Annual International ASIC/SOC Conference, pp: 97-101.
5. Hasan, M.A., M.Z. Wang and V.K. Bhargava, 1993. A modified Massey-Omura parallel multiplier for a class of finite fields. IEEE Trans. Comput., 42: 1278-1280.
6. m) using normal basis. Inform. Comput., 78: 171-177.
7. m). Electronics Letters.
8. Koblitz, N., 1987. Elliptic curve cryptosystems. Mathematics of Computation, 48: 203-209.
9. Koc, C. K. and B. Sunar, 1998. Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields. IEEE Trans. Comput., 47: 353-356.
10. Lidl, R. and H. Niederreiter, 1994. Introduction to Finite Fields and Their Applications. Cambridge University Press, Cambridge, UK., Revised Edition.
11. Massey, J.L. and J.K. Omura, 1986. Computational method and apparatus for finite field arithmetic. US Patent No. 4: 587, 627.
12. Menezes, A.J., 1993. Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers.
13. Menezes, A.J., I.F. Blake, X. Gao, R.C. Mullin, S.A. Vanstone and T. Yaghoobian, 1993. Applications of Finite Fields. Kluwer Academic Publishers, Boston, MA.
14. m). Discrete Appl. Math., 22: 149-161.
15. m). IEEE Trans. Comput., 51: 511-520.
16. Reyhani-Masoleh, A. and M.A. Hasan, 2004. Efficient digit-serial normal basis multipliers over binary extension fields. In ACM Trans. on Embedded Computing Systems, 3: 575-592.
17. Rosing, M., 1999. Implementing Elliptic Curve Cryptography. Manning Publications Company.
18. Sunar, B. and C.K. Koc, 2001. An efficient optimal normal basis Type II multiplier. IEEE Trans. Comput., 50: 83-88.
19. m). Using normal basis. IEEE Transactions on Computers, 50: 394-398.
20. m). IEEE Trans. Comput, 34: 709-716.
21. Wu, H., A. Hasan, I. Blake and S. Gao, 2002. Finite field multiplier using redundant representation. IEEE Trans. Comput., 51: 1306-1316.
22. m). Electronics Lett., 33: 196-197.