Semi-systolic Modular Multiplier over GF(2m)

Authors:
Hyun-Sung Kim;Sung-Woon Lee
Affiliations:
School of Computer Engineering, Kyungil University, Kyungsansi, Korea 712-701;Dept. of Information Security, Tongmyong University, Busan, Korea 608-711
Venue:
ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
Year:
2008

Citing 6
Cited 0

VLSI array processors

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

Information and Computation
A systolic array design methodology for sequential loop algorithms

A systolic array design methodology for sequential loop algorithms
Elliptic Curve Public Key Cryptosystems

Elliptic Curve Public Key Cryptosystems
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

The key operations for the public-key cryptosystems are modular inversion, division, and exponentiation. The modular multiplication is considered to be the basic arithmetic for them. This paper proposes a new algorithm and it's semi-systolic array architecture 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 has the critical path with 1-DXORper cell and has the latency with m+1. These properties are better than the existing multipliers. Since the proposed multiplier has regularity, modularity and concurrency, it is suitable for VLSI implementation and can be easily utilized for the crypto-processor chip design.