GF（2^m）域高效椭圆曲线标量乘结构的研究  

Research of high performance architecture for elliptic curve scalar multiplication over GF（2m）

作　　者：但永平[1] 邹雪城[1] 刘政林[1] 韩煜[1] 

机构地区：[1]华中科技大学电子科学与技术系,湖北武汉430007

出　　处：《华中科技大学学报（自然科学版）》2008年第11期48-51,共4页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：国家高技术研究发展计划资助项目(2006AA01Z226)

摘　　要：为提高椭圆曲线加密运算的速度,提出了一种多项式基表示的GF(2m)域高效标量乘加速器结构.该结构对面积和性能进行了合理的权衡,采用点加、倍点模块并行运算以提高速度;为了减少面积采用并行和串行相结合的方法对点加和倍点模块进行优化,初始化和最后的坐标变换求逆模块通过优化分解成一系列乘和加运算,合并在一个模块中用串行结构实现.采用Xilinx公司的VirtexE XCV2600 FPGA硬件实现结果表明,完成有限域GF(2163)上任意椭圆曲线上的一次标量乘的全部运算时间消耗为36.5μs,适合高性能椭圆曲线加密应用的要求.A efficient hardware architecture accelerators to speed up the scalar multiplications on elliptic curves over GF（2m） in polynomial basis representation was proposed. The performance and area trade-off is considered reasonably. The point addition module and point doubling module can operation in parallel. They are optimized and implemented by the method of combining parallel and serial. Ini- tialization and the final coordinates conversion module are decomposed into a series of multiplication and addition operations, which can be merged into one module finally. The implementation results based on Xilinx VirtexE XCV2600 FPGA show that our proposed design is able to compute general GF（2^163） elliptic curve scalar multiplication operations in 36.5μs, which indicates this architecture is suitable for high-performance application.

关 键 词：密码 椭圆曲线 标量乘 有限域 坐标变换 

分 类 号：TN402[电子电信—微电子学与固体电子学]