New Montgomery-based Semi-systolic Multiplier for Even-type GNB of GF(2^m).
IACR Cryptology ePrint Archive 01/2010; 2010:218.
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.
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.