- 期刊
Low-Complexity Parallel Systolic Architectures for Computing Multiplication and Squaring over GF(2(superscript m)
並列摘要
Recently, cryptographic applications based on finite fields have attracted much interest. This paper presents a unified systolic multiplier under the method of the multiply-by-x² and the folded technique. This circuit is particularly suitable for implementing multiplication and squaring in GF(2(superscript m). The results show that our proposed multiplier saves up to 75% space complexity and 50% latency as compared to the traditional multipliers proposed by Yeh et al. and Wang-Lin. Also, the proposed squarer saves about 45% space complexity as compared to the traditional squarer presented by Guo and Wang.
延伸閱讀
- 蔡明宏（2009）。On a symplecticity and dispersion relation preserving parallel solver for Maxwell's equations〔碩士論文，國立臺灣大學〕。華藝線上圖書館。https://doi.org/10.6342/NTU.2009.02458
- 何敬傑（2015）。Designing Parallel and Distributed Computing Architecture for Motion Estimation Algorithms in Video Coding〔碩士論文，國立臺中科技大學〕。華藝線上圖書館。https://doi.org/10.6826/NUTC.2015.00080
- Abbas, M., Aydi, H., & Karapınar, E. (2011). Tripled Fixed Points of Multivalued Nonlinear Contraction Mappings in Partially Ordered Metric Spaces. Abstract and Applied Analysis, (2011), 3480-3491. https://doi.org/10.1155/2011/812690
- Bianchi, M. (2011). On R^4 Terms and MHV Amplitudes in N=5, 6 Supergravity Vacua of Type II Superstrings. Advances in High Energy Physics, 2011(), 260-277. https://doi.org/10.1155/2011/479038
- 李家智（2006）。Shifting Sequential Archive of Sub-Population Genetic Algorithm in Solving Multi-Objective Problem〔碩士論文，元智大學〕。華藝線上圖書館。https://doi.org/10.6838/YZU.2006.00214