A fast implementation of multiplicative inversion over GF(2 m)

Francisco Rodríguez-Henríquez, Nazar A. Saqib, Nareli Cruz-Cortés

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

34 Scopus citations

Abstract

In this paper, an efficient architecture for multiplicative inversion in GF(2 m) using addition chains is presented. The approach followed was based on the Itoh-Tsujii algorithm targeting a fast implementation on reconfigurable hardware devices. We give the design details of the proposed architecture whose main building blocks are a field multi-squarer block, a field polynomial multiplier and a BRAM two-ports memory. Our design is able to compute multiplicative inversion in GF(2 193) in about 1.33μS using only 27 clock cycles.

Original languageEnglish
Title of host publicationProceedings ITCC 2005 - International Conference on Information Technology
Subtitle of host publicationCoding and Computing
EditorsH. Selvaraj, P.K. Srimani
Pages574-579
Number of pages6
StatePublished - 2005
Externally publishedYes
EventITCC 2005 - International Conference on Information Technology: Coding and Computing - Las Vegas, NV, United States
Duration: 4 Apr 20056 Apr 2005

Publication series

NameInternational Conference on Information Technology: Coding and Computing, ITCC
Volume1

Conference

ConferenceITCC 2005 - International Conference on Information Technology: Coding and Computing
Country/TerritoryUnited States
CityLas Vegas, NV
Period4/04/056/04/05

Fingerprint

Dive into the research topics of 'A fast implementation of multiplicative inversion over GF(2 m)'. Together they form a unique fingerprint.

Cite this