Improved VLSI designs for multiplication and inversion in GF(2/sup M/) over normal bases

Finite field arithmetic circuits are a core part for implementing some cryptographic systems and Reed-Solomon codes. In this paper, improved VLSI designs for computing multiplication and inverse in GF(2/sup m/) over normal bases are presented. The improvements over the previous publications for the...

Full description

Saved in:
Bibliographic Details
Main Authors: Lijun Gao, Sobelman, G.E.
Format: Conference Proceeding
Language:English
Subjects:
Arithmetic
CMOS logic circuits
Computer architecture
Cryptography
Energy consumption
Galois fields
Logic circuits
Logic design
Reed-Solomon codes
Very large scale integration
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Finite field arithmetic circuits are a core part for implementing some cryptographic systems and Reed-Solomon codes. In this paper, improved VLSI designs for computing multiplication and inverse in GF(2/sup m/) over normal bases are presented. The improvements over the previous publications for the Massey-Omura multiplier include both circuit and architecture (or logic) levels. At circuit level, the improved design reduces the area and power consumption, and is faster than the previous design. At architecture level, the new design reduces logic complexity and is more regular, which, in turn, allows static CMOS design and reduces power dissipation. The latency of the inversion method is reduced with parallelism exploration at no cost in hardware. Therefore, the work presented in this paper can provide better VLSI designs in terms of performance and power consumption.
DOI:10.1109/ASIC.2000.880683