Subscribe Now Subscribe Today
Science Alert
 
Blue
   
Curve Top
Journal of Applied Sciences
  Year: 2006 | Volume: 6 | Issue: 6 | Page No.: 1362-1372
DOI: 10.3923/jas.2006.1362.1372
 
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Hardware Implementations of GF (2m) Arithmetic Using Normal Basis

Turki F. Al-Somani and Alaaeldin Amin

Abstract:
This study presents a survey of algorithms used in field arithmetic over GF (2m) using normal basis and their hardware implementations. These include the following arithmetic field operations: addition, squaring, multiplication and inversion. This study shows that the type II Sunar-Koc multiplier is the best multiplier with a hardware complexity of m2 AND gates + XOR gates and a time complexity of TA+ (1+ l log2 (m) l )Tx. The study also show that the Itoh-Tsujii inversion algorithm was the best inverter and it requires almost log2 (m-1) multiplications.
PDF Fulltext XML References Citation Report Citation
How to cite this article:

Turki F. Al-Somani and Alaaeldin Amin , 2006. Hardware Implementations of GF (2m) Arithmetic Using Normal Basis. Journal of Applied Sciences, 6: 1362-1372.

DOI: 10.3923/jas.2006.1362.1372

URL: https://scialert.net/abstract/?doi=jas.2006.1362.1372

COMMENT ON THIS PAPER
 
 
 

 

 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 

Curve Bottom