- 期刊
Parallel Algorithm for Polynomial Basis Multiplier in GF(2(superscript m)) Fields
並列摘要
Fast multiplication in a finite field GF(2(superscript m)) is a basis step in communications engineering applications, such as error-correcting codes or cryptograph algorithms. A new parallel algorithm on the polynomial basis bit-parallel multiplier is presented. This new parallel algorithm saves about 25% execution time while comparing with the conventional algorithms. The hardware version for the proposed parallel algorithm is also invented. The new hardware structure requires only the space complexity of O(m) while existing multipliers need the space complexity of O(m^2). The time complexity of the proposed multiplier takes only about half of the time complexity of the existing Lee's multiplier.
延伸閱讀
- 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
- Chiou, C. W., Chou, F. H., Shu, S. F., & Lin, J. M. (2005). A Pipeline Algorithm to Speed up Array Multipliers in GF(2(superscript m)) Fields. 淡江理工學刊, 8(4), 273-282. https://doi.org/10.6180/jase.2005.8.4.03
- Huang, W. T., Tan, S. Y., Chiou, C. W., Tuan, C. C., & Chang, C. H. (2013). On-line Error Detection in a Polynomial Basis Multiplier over GF(2^m) Using Self-Checking Alternating Logic. 電腦學刊, 24(2), 46-58. https://www.airitilibrary.com/Article/Detail?DocID=19911599-201307-201308020033-201308020033-46-58
- Chiou, C. W., Lee, C. Y., & Yeh, Y. C. (2010). Sequential Type-I Optimal Normal Basis Multiplier and Multiplicative Inverse in GF(2(superscript m)). 淡江理工學刊, 13(4), 423-432. https://doi.org/10.6180/jase.2010.13.4.08
- 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