华南理工大学学报(自然科学版) ›› 2010, Vol. 38 ›› Issue (5): 90-94.doi: 10.3969/j.issn.1000-565X.2010.05.018

• 计算机科学与技术 • 上一篇    下一篇

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

何德彪 陈建华 胡进   

  1. 武汉大学 数学与统计学院, 湖北 武汉 430072
  • 收稿日期:2009-06-05 修回日期:2009-09-09 出版日期:2010-05-25 发布日期:2010-05-25
  • 通信作者: 何德彪(1980-),男,博士,讲师,主要从事数论与密码研究. E-mail:hedebiao@163.com
  • 作者简介:何德彪(1980-),男,博士,讲师,主要从事数论与密码研究.
  • 基金资助:

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

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

He De-biao  Chen Jian-hua  Hu Jin   

  1. School of Mathematics and Statistics,Wuhan University,Wuhan 430072,Hubei,China
  • Received:2009-06-05 Revised:2009-09-09 Online:2010-05-25 Published:2010-05-25
  • Contact: 何德彪(1980-),男,博士,讲师,主要从事数论与密码研究. E-mail:hedebiao@163.com
  • About author:何德彪(1980-),男,博士,讲师,主要从事数论与密码研究.
  • Supported by:

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

摘要: 为提高椭圆曲线密码协处理器的性能,首先提出了一种改进的蒙哥马利模乘算法以及针对该算法的流水线结构,然后对椭圆曲线的点加和点倍计算流程进行优化,充分发挥模乘单元的流水线优势,使得协处理器计算参数为256 b的点乘只需要232 704个时钟周期.实验结果表明:在Cycloe Ⅱ EP2C35芯片上实现协处理器需要21000个基本单元,位长为256 b的点乘的计算性能达到1287次/s.

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

Abstract:

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.

Key words: public key cryptography, multiplier, field programmable gate array, elliptic curve cryptography, Montgomery modular multiplication