A Class of Unidirectional Bit Serial Systolic Architectures for Multiplicative Inversion and Division over {\rm GF}(2^m)

Authors:
Amir K. Daneshbeh;M. Anwar Hasan
Affiliations:
IEEE;IEEE
Venue:
IEEE Transactions on Computers
Year:
2005

Citing 8
Cited 4

A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases

Information and Computation
Systolic Array Implementation of Euclid's Algorithm for Inversion and Division in GF (2m)

IEEE Transactions on Computers
Double-Basis Multiplicative Inversion Over GF(2m)

IEEE Transactions on Computers
Handbook of Applied Cryptography

Handbook of Applied Cryptography
On Computing Multiplicative Inverses in GF(2/sup m/)

IEEE Transactions on Computers
Fast Key Exchange with Elliptic Curve Systems

CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
A Unidirectional Bit Serial Systolic Architecture for Double-Basis Division over GF(2m)

ARITH '03 Proceedings of the 16th IEEE Symposium on Computer Arithmetic (ARITH-16'03)
High-Speed C-Testable Systolic Array Design for Galois-Field InversionChih-Tsun Huang and Cheng-Wen Wu

EDTC '97 Proceedings of the 1997 European conference on Design and Test

Applying systolic multiplication-inversion architectures based on modified extended Euclidean algorithm for GF(2k) in elliptic curve cryptography

Computers and Electrical Engineering
Fast hardware algorithm for division in GF(2m) based on the extended Euclid's algorithm with parallelization of modular reductions

IEEE Transactions on Circuits and Systems II: Express Briefs
A high-performance unified-field reconfigurable cryptographic processor

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Computing the modular inverses is as simple as computing the GCDs

Finite Fields and Their Applications

Quantified Score

Hi-index	14.98

Visualization

Abstract

A class of universal unidirectional bit serial systolic architectures for multiplicative inversion and division over Galois field {\rm GF}(2^m) is presented. The field elements are represented with polynomial (standard) basis. These systolic architectures have no carry propagation structures and are suitable for hardware implementations where the dimension of the field is large and may vary. This is the typical case for cryptographic applications. These architectures are independent of any defining irreducible polynomial of a given degree as well. The time complexity is constant and area complexity is linear (w.r.t. field dimension) and these measures are equivalent to or exceed similar proposed designs.