New Montgomery-based Semi-systolic Multiplier for Even-type GNB of GF(2^m).

IACR Cryptology ePrint Archive 01/2010; 2010:218.
Source: DBLP


Efficient finite field multiplication is crucial for implementing public key cryptosystem. Based on new Gaussian normal basis Montgomery (GNBM) representation, this paper presents a semi-systolic even-type GNBM multiplier. Compared with the only existing semi-systolic even-type GNB multiplier, the proposed multiplier saves about 57% space complexity and 50% time complexity. Index Terms—Finite field multiplication, Gaussian normal basis, elliptic curve cryptosystem, Montgomery, systolic architecture.

10 Reads