Self-Checking Gaussian Normal Basis Multiplier over GF(2m) Using Multiplexer Approach

The elliptic curve cryptosystem is very attractive for the use in portable devices due to small key size. the finite field multiplication over GF(2^m) is the most important arithmetic for performing the elliptic curve cryptosystem. Design of low cost finite field multiplier for elliptic curve cryptosystem is needed. the proposed self-checking alternating logic (SCAL) GNB multiplier using multiplexer approach is with both concurrent error detection and off-line testing capabilities. the concurrent error detection capability can give countermeasure to fault-based cryptanalysis. the proposed SCAL GNB multiplier using multiplexer approach can save about 18% space complexity as compared to existing similar study.