Citation
Abstract
Finite field multiplication is central to coding theory. For this application, there is a need for a multiplication algorithm which can be realized easily on VLSI chips. In this article, a new algorithm is developed which is based on the Babylonian multiplication technique utilizing tables of squares. This new algorithm is applied to the finite fields GF(q^m), where q = 3 and 5. It is also shown that this new multiplier can be used to compute complex multiplications defined on the direct sum of two identical copies of such Galois fields..
Details
- Volume
- 42-93
- Published
- May 15, 1988
- Pages
- 155–162
- File Size
- 303.3 KB