Concurrent Error Detection and Correction in Polynomial Basis Multiplier over GF(2^m)

• Main Authors: Chi Hiang Chang, 張智翔
• Other Authors: Che Wun Chiou
• Format: Others
• Language: zh-TW
• Published: 2007
• Online Access: http://ndltd.ncl.edu.tw/handle/06617899142859041297

碩士 === 清雲科技大學 === 電子工程研究所 === 94 === Finite field arithmetic has been widely used in many cryptosystems, especially Elliptic Curve Cryptosystem (ECC), for speeding their encryption/decryption processes. Regular structures of finite field arithmetic are suitable for VLSI implementation and then make them very attractive for mobile commerce. The multiplication is the most critical operation in finite field arithmetic operations. Recently, a new cryptanalysis, termed fault based cryptanalysis which deliberates fault injection into cryptographic devices, only require a small amount of side-channel information to break common ciphers. Hence, effective and simple methods for protecting the encryption/decryption circuitry from an attacker are required to ensure that a cryptographic device can output the accurate signature. Therefore, in this paper, a polynomial basis multiplier over GF(2m) with concurrent error detection is presented. Moreover, a polynomial basis multiplier with concurrent error correction is also included. Furthermore, the parallel structure of function cells in the proposed multiplier array is employed for speeding up propagation delay.