Concurrent Error Detection and Correction in Polynomial Basis Multiplier over GF(2^m)
碩士 === 清雲科技大學 === 電子工程研究所 === 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...
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 |
Similar Items
-
Design of Polynomial Basis Multipliers over GF(2m) with Concurrent Error Detection
by: Chih Hsiang Chang, et al.
Published: (2011) -
Concurrent Error Correction in Polynomial Basis Multiplier over GF(2^m)
by: Yih-Ming Huang, et al.
Published: (2005) -
Design of Polynomial Basis Multiplier over GF(2m) with Error Detection and Confusion Capabilities
by: Chia-Jen Wu, et al.
Published: (2009) -
Novel Systolic Mastrovito Polynomial Basis Multiplier over GF(2m)
by: Ma, Chi-Ting, et al.
Published: (2011) -
Fault Detection and Correction in Dual Basis Multiplier overGF(2m) and Its Implementation on FPGA
by: Chang Hung Wei, et al.
Published: (2007)