Citation
Abstract
Finite field arithmetic logic is central in the implementation of Reed-Solomon coders and in some cryptographic algorithms. There is a need for good multiplication and inversion algorithms that can be easily realized on VLSI chips. Massey and Omura recently developed a new multiplication algorithm for Galois fields based on a normal basis representation. In this paper, a pipeline structure is developed to realize the Massey-Omura multiplier in the finite field GF(2™ ). With the simple squaring property of the normat-basis representation used together with this multiplier, a pipeline architecture is also developed for computing inverse elements in GF(2™ ). The designs developed for the Massey-Omura multiplier and the computation of inverse elements are regular, simple, expandable and, therefore, naturally suitable for VLSI implementation.
Details
- Volume
- 42-75
- Published
- November 15, 1983
- Pages
- 52–64
- File Size
- 728.7 KB