The Community for Technology Leaders
Subscribe
Issue No.07 - July (2000 vol.49)
pp: 749-758
ABSTRACT
<p><b>Abstract</b>—Many cryptographic systems use multiplication in the finite field GF(<tmath>$2^n$</tmath>) for their underlying computations. In the recent past, a number of look-up table-based algorithms have been proposed for the software implementation of GF(<tmath>$2^n$</tmath>) multiplication. Look-up table-based algorithms can provide speed advantages, but they either require a large memory space or do not fully utilize the resources of the processor on which the software is executed. In this work, an algorithm for GF(<tmath>$2^n$</tmath>) multiplication is proposed which can alleviate this problem. In each iteration of the proposed algorithm, a group of bits of one of the input operands are examined and two look-up tables are accessed. The group size determines the table sizes, but does not affect the utilization of the processor resources. It can be used for both software and hardware realizations and is particularly suitable for implementations in memory constrained environment, such as smart cards and embedded cryptosystems.</p>
INDEX TERMS
Computer arithmetic, Galois (or finite) field multiplication, cryptographic systems, polynomial basis and look-up tables.
CITATION
M. Anwarul Hasan, "Look-Up Table-Based Large Finite Field Multiplication in Memory Constrained Cryptosystems", IEEE Transactions on Computers, vol.49, no. 7, pp. 749-758, July 2000, doi:10.1109/12.863045