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

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

Research output: Contribution to conferencePaper

23 Citations (Scopus)

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. © 2005 IEEE.
Original languageAmerican English
Pages574-579
Number of pages516
StatePublished - 22 Sep 2005
Externally publishedYes
EventInternational Conference on Information Technology: Coding and Computing, ITCC -
Duration: 22 Sep 2005 → …

Conference

ConferenceInternational Conference on Information Technology: Coding and Computing, ITCC
Period22/09/05 → …

Fingerprint

Reconfigurable hardware
Clocks
Polynomials
Data storage equipment

Cite this

Rodríguez-Henríquez, F., Saqib, N. A., & Cruz-Cortés, N. (2005). A fast implementation of multiplicative inversion over GF(2 m). 574-579. Paper presented at International Conference on Information Technology: Coding and Computing, ITCC, .
Rodríguez-Henríquez, Francisco ; Saqib, Nazar A. ; Cruz-Cortés, Nareli. / A fast implementation of multiplicative inversion over GF(2 m). Paper presented at International Conference on Information Technology: Coding and Computing, ITCC, .516 p.
@conference{0bd8d2e7e8e44adc942e16c5a3d6beb6,
title = "A fast implementation of multiplicative inversion over GF(2 m)",
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. {\circledC} 2005 IEEE.",
author = "Francisco Rodr{\'i}guez-Henr{\'i}quez and Saqib, {Nazar A.} and Nareli Cruz-Cort{\'e}s",
year = "2005",
month = "9",
day = "22",
language = "American English",
pages = "574--579",
note = "International Conference on Information Technology: Coding and Computing, ITCC ; Conference date: 22-09-2005",

}

Rodríguez-Henríquez, F, Saqib, NA & Cruz-Cortés, N 2005, 'A fast implementation of multiplicative inversion over GF(2 m)', Paper presented at International Conference on Information Technology: Coding and Computing, ITCC, 22/09/05 pp. 574-579.

A fast implementation of multiplicative inversion over GF(2 m). / Rodríguez-Henríquez, Francisco; Saqib, Nazar A.; Cruz-Cortés, Nareli.

2005. 574-579 Paper presented at International Conference on Information Technology: Coding and Computing, ITCC, .

Research output: Contribution to conferencePaper

TY - CONF

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

AU - Rodríguez-Henríquez, Francisco

AU - Saqib, Nazar A.

AU - Cruz-Cortés, Nareli

PY - 2005/9/22

Y1 - 2005/9/22

N2 - 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. © 2005 IEEE.

AB - 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. © 2005 IEEE.

UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=24744433086&origin=inward

UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=24744433086&origin=inward

M3 - Paper

SP - 574

EP - 579

ER -

Rodríguez-Henríquez F, Saqib NA, Cruz-Cortés N. A fast implementation of multiplicative inversion over GF(2 m). 2005. Paper presented at International Conference on Information Technology: Coding and Computing, ITCC, .