KFUPM ePrints

Hardware Implementations of GF(2^m) Arithmetic using Normal Basis

Amin, Alaaeldin and Al-Somani, Turki Faisal (2006) Hardware Implementations of GF(2^m) Arithmetic using Normal Basis. Journal of Applied Sciences, 6 (6). pp. 1362-1372.

Full text not available from this repository.

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.



Item Type:Article
Date:2006
Date Type:Publication
Subjects:Computer
Divisions:College Of Computer Sciences and Engineering > Computer Engineering Dept
Creators:Amin, Alaaeldin and Al-Somani, Turki Faisal
Email:amindin@kfupm.edu.sa, tfsomani@uqu.edu.sa
ID Code:1238
Deposited By:Obaid-Ur-Rehman Khattak
Deposited On:28 Apr 2008 15:23
Last Modified:12 Apr 2011 13:08

Repository Staff Only: item control page