Ⅱ类正规基快速模乘算法的设计与实现  

Design and Realization of Fast Modular Multiplication Based on Normal Basis of TypeⅡ

作　　者：王友波[1] 

机构地区：[1]北京理工大学计算机科学工程系,北京100081

出　　处：《计算机应用研究》2005年第9期206-207,210,共3页Application Research of Computers

基　　金：国家部委基础科研项目(J1400B006)

摘　　要：为寻求椭圆曲线密码应用系统中有限域上快速模乘算法,在Ⅱ类最佳正规基及其变形的类标准基基础上,提出了一种新的Ⅱ类最佳正规基快速模乘算法,并给出该算法FPGA实现的硬件结构。新的乘法器采用比特串行方式,使得硬件结构更加规则,减少了原有乘法器关键路径的延迟。试验数据表明,使用新的乘法器可以使整个椭圆曲线密码系统芯片工作频率大幅度提高。To find a fast modular multiplication algorithm in finite fields used in Elliptic Curve Cryptosystem（ ECC）, a new fast modular multiplication algorithm based on type of optimal normal basis of type Ⅱ is proposed. A hardware architecture for FPGA realization is also provided. The multiplier in this paper is Bit-serial mode and the new hardware architecture is regular which reduces the delay of the critical path. Experiment results show that the frequency of Elliptic Curve Cryposystem chip has been greatly increased with the new multiplier.

关 键 词：最佳正规基 有限域 模乘 比特串行 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]