高速椭圆曲线密码协处理器的设计与实现  

Design and Implementation of High-Speed Coprocessor for Elliptic Curve Cryptography

作　　者：何德彪[1] 陈建华[1] 胡进[1] 

机构地区：[1]武汉大学数学与统计学院,湖北武汉430072

出　　处：《华南理工大学学报（自然科学版）》2010年第5期90-94,共5页Journal of South China University of Technology(Natural Science Edition)

基　　金：湖北省科技计划项目(20094073532)

摘　　要：为提高椭圆曲线密码协处理器的性能,首先提出了一种改进的蒙哥马利模乘算法以及针对该算法的流水线结构,然后对椭圆曲线的点加和点倍计算流程进行优化,充分发挥模乘单元的流水线优势,使得协处理器计算参数为256 b的点乘只需要232 704个时钟周期.实验结果表明:在Cycloe Ⅱ EP2C35芯片上实现协处理器需要21000个基本单元,位长为256 b的点乘的计算性能达到1287次/s.In order to enhance the performance of the processor for elliptic curve cryptography,an improved alogorithm of Montgomery modular multiplication is proposed,and a pipelined hardware structure for the algorithm is constructed.Then,the computation of point addition and point double of elliptic curve are optimized to fully take the advantages of modular multiplication.Thus,the point multiplication with 256b length parameters costs only 232704 clock cycles.The implementation on Cyclone II EP2C35 shows that the coprocessor needs 21000 slices and can fi-nish 1287 point multiplicaions per second for 256b length.

关 键 词：公钥密码 乘法器 现场可编程门列阵 椭圆曲线密码 蒙哥马利模乘 

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