透過您的圖書館登入
IP:3.145.101.53
  • 期刊

Digit-Serial Systolic Karatsuba Multiplier for Special Classes over GF(2^m)

並列摘要


Finite field multiplication over GF (2^m) is one of the most important arithmetic operations for Elliptic Curve Cryptosystem (ECC). Polynomial basis multipliers over GF (2^m) are widely applied in ECC due to its regular, modular, easily expansible benefits and the high suitability for VLSI implementation. This study will present a novel digit-serial polynomial basis multiplier using Karatsuba algorithm representation. To achieve efficient architectures, our proposed digit-serial architecture is different from existing digit-serial polynomial basis multipliers that use cut-set algorithm. The proposed digit-serial polynomial basis multiplier saves 90% space complexity as compared to existing similar studies. Existing digit-serial polynomial basis multipliers employ one dimensional array of digit cells, but our proposed digit-serial polynomial basis multiplier uses only one digit cell.

被引用紀錄


Chuang, T. P. (2011). 高斯正規基底有限場乘法器具容錯架構之電路設計 [doctoral dissertation, National Taiwan Normal University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0021-1610201315251524

延伸閱讀