|
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. , |
