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

Efficient VLSI Implementation for Montgomery Multiplication in GF(2(superscript m))

並列摘要


The Montgomery multiplication algorithm without division operations is popular both in prime field GF(p) and Finite field GF(2(superscript m)). However, the Montgomery multiplication algorithm has the time-dependent problem. We will present a time-independent Montgomery multiplication algorithm. The results show that our proposed time-independent Montgomery multiplication algorithm not only saves about 50% time complexity but also saves about 11% space complexity as compared to the traditional Montgomery multiplication algorithm. Our proposed systolic array Montgomery multiplier has simplicity, regularity, modularity, and concurrency, and is very suitable for VLSI implementation.

被引用紀錄


Chang, H. W. (2013). 低複雜度及具錯誤偵測功能之有限場乘法器 [doctoral dissertation, National Taipei University of Technology]. Airiti Library. https://doi.org/10.6841/NTUT.2013.00424
Chang, C. H. (2011). 具即時錯誤偵測之有限場多項式基底乘法器設計 [doctoral dissertation, National Taipei University of Technology]. Airiti Library. https://doi.org/10.6841/NTUT.2011.00131

延伸閱讀