Efficient Montgomery-Based Semi-Systolic Multiplier for Even-Type GNB of GF(2^m)

摘要

Efficient finite field multiplication is crucial for implementing public key cryptosystem. To achieve this, multipliers using Gaussian normal basis have been widely explored in previous works. In this paper, based on proposed Gaussian normal basis Montgomery (GNBM) representation, a semi-systolic even-type GNBM multiplier is developed. Analysis shows that the proposed architecture saves about 57 percent space complexity and 50 percent time complexity when compared with the only existing semi-systolic even-type GNB multiplier. Moreover, due to properties of regularity and modularity, the proposed multiplier is very suitable for VLSI implementation.