Computer Science & Technology

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

Expand
  • School of Mathematics and Statistics,Wuhan University,Wuhan 430072,Hubei,China
何德彪(1980-),男,博士,讲师,主要从事数论与密码研究.

Received date: 2009-06-05

  Revised date: 2009-09-09

  Online published: 2010-05-25

Supported by

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

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.

Cite this article

He De-biao Chen Jian-hua Hu Jin . Design and Implementation of High-Speed Coprocessor for Elliptic Curve Cryptography[J]. Journal of South China University of Technology(Natural Science), 2010 , 38(5) : 90 -94 . DOI: 10.3969/j.issn.1000-565X.2010.05.018

Outlines

/