Design and Implementation of Modular Multiplication Instruction and Hardware in Finite Fields
Based on analysis of finite field modular multiplication requirement of ECC, the application specific instruction for modular multiplication computation has been designed in this paper, which can handle operands of any size both in binary extension field GF(2m) and prime field GF(p). The corresponding hardware actually adopts Montgomery modular multiplication algorithm and unified pipeline architecture in dual fields, and realizes modular multiplication computation with high speed. The experimental results prove that the modular multiplication instruction and hardware unit presented in this paper can achieve high performance and guarantee high flexibility for various ECC algorithms.
Binary extension finite field Prime finite field Modular multiplication Application Specific Instruction Montgomery algorithm
Dai Zibin Li Miao Yang Tongjie Yang Xiaohui Zhang Jun
Zhengzhou Information Science and Technology Institute Zhengzhou, China
国际会议
成都
英文
801-804
2010-12-17（万方平台首次上网日期，不代表论文的发表时间）