Semi-systolic architecture for modular multiplication over GF(2m)

Authors:
Hyun-Sung Kim;Il-Soo Jeon
Affiliations:
School of Computer Engineering, Kyungil University, Kyungsansi, Kyungpook Province, Korea;School of Electronic Eng., Kumho Nat’l Inst. of Tech., Gumi, Kyungpook Province, Korea
Venue:
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
Year:
2005

Citing 4
Cited 0

VLSI array processors

VLSI array processors
Structure of parallel multipliers for a class of fields GF(2m)

Information and Computation
Systolic Multipliers for Finite Fields GF(2m)

IEEE Transactions on Computers
Efficient semisystolic architectures for finite-field arithmetic

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a new algorithm and an architecture for it to compute the modular multiplication over GF(2m). They are based on the standard basis representation and use the property of irreducible all one polynomial as a modulus. The architecture, named SSM(Semi-Systolic Multiplier) has the critical path with 1-DAND+1-DXOR per cell and the latency of m+1. It has a lower latency and a smaller hardware complexity than previous architectures. Since the proposed architecture has regularity, modularity and concurrency, they are suitable for VLSI implementation.