- 期刊
Sequential Type-I Optimal Normal Basis Multiplier and Multiplicative Inverse in GF(2(superscript m))
並列摘要
This study presents a novel sequential Type-I optimal normal basis multiplier in GF(2(superscript m)) with a regular structure. The proposed multiplier has a slightly higher space complexity than the Reyhani-Masoleh-Hasan's (RMH) multiplier, but is 27% faster than the RMH multiplier. Furthermore, the proposed multiplier is highly regular, modular, expandable and well-suited to VLSI implementation. A new normal basis inverter based on the proposed multiplier is also invented. The proposed inverter provides better time-area complexity than existing inverters as with large m.
被引用紀錄
Tseng, H. K. (2007). 雙層印刷電路板之多頻帶手持裝置天線 [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2007.01859
延伸閱讀
- 吳嘉仁（2009）。Design of Polynomial Basis Multiplier over GF(2m) with Error Detection and Confusion Capabilities〔碩士論文，健行科技大學〕。華藝線上圖書館。https://doi.org/10.6824/UCH.2009.00059
- Chiou, C. W., & Lin, L. C. (2004). Fast Array Multiplications over GF(2(superscript m)) Fields with Multiple Speeds. 淡江理工學刊, 7(3), 139-144. https://doi.org/10.6180/jase.2004.7.3.03
- Ramasamy, R., & Muniyandi, A. P. (2010). Computing the Modular Inverse of a Polynomial Function over GF(2(superscript P)) Using Bit Wise Operation. International Journal of Network Security, 10(2), 107-113. https://doi.org/10.6633/IJNS.201003.10(2).04
- Zhou, J. Q. (2008). Fast Algorithms for Determining the Minimal Polynomials of Sequences with Period kn over GF(P(superscript m)). International Journal of Network Security, 7(1), 38-41. https://doi.org/10.6633/IJNS.200807.7(1).05
- Lee, C. Y. (2009). Low-Complexity Parallel Systolic Architectures for Computing Multiplication and Squaring over GF(2(superscript m). 電腦學刊, 19(4), 20-30. https://www.airitilibrary.com/Article/Detail?DocID=19911599-200901-19-4-20-30-a