基于FPGA的Fm2域椭圆曲线点乘的快速实现

计算机应用 ›› 2011, Vol. 31 ›› Issue (02): 540-542.

基于FPGA的Fm2域椭圆曲线点乘的快速实现

魏东梅¹,杨涛²

1. 西南科技大学信息工程学院
2.

收稿日期:2010-07-27 修回日期:2010-09-01 发布日期:2011-02-01 出版日期:2011-02-01
通讯作者: 魏东梅

Fast implementation of point multiplication over elliptic curveFm2based on FPGA

Received:2010-07-27 Revised:2010-09-01 Online:2011-02-01 Published:2011-02-01
Contact: WEI Dong-Mei

摘要/Abstract

摘要： 椭圆曲线点乘的实现速度决定了椭圆曲线密码算法（ECC）的实现速度。采用蒙哥马利点乘算法，其中模乘运算、模平方运算采用全并行算法，模逆运算采用费马·小定理并在实现中进行了优化，完成了椭圆曲线点乘的快速运算。采用Xilinx公司的Virtex-5器件族的XCV220T作为目标器件，完成了综合与实现。通过时序后仿真，其时钟频率可以达到40MHz，实现一次点乘运算仅需要14.9μs。

关键词: 椭圆曲线密码算法, 模乘, 点乘

Abstract: The implementation speed of Elliptic Curve Cryptography (ECC) depends on the implementation speed of elliptic curve point multiplication. Point multiplication of elliptic curve using Montgomery algorithm was proposed in this paper. Parallel algorithm was used in modular multiplication algorithm and modular square algorithm, as well as Fermats Little Theorem was used and optimized in modular inversion, thus the fast operation of elliptic curve point multiplication was implemented. Synthesis and implementation were realized in a Xilinx device of XC5VLX220T. Through timing simulation, the clock frequency can achieve 40MHz. It takes only 14.9μs to carry out one point multiplication operation.

Key words: Elliptic Curve Cryptography (ECC), modular multiplication, point multiplication

魏东梅杨涛. 基于FPGA的Fm2域椭圆曲线点乘的快速实现[J]. 计算机应用, 2011, 31(02): 540-542.

[1]	车文博, 刘衡竹, 田甜. M-DSP中高性能浮点乘加器的设计与实现[J]. 计算机应用, 2016, 36(8): 2213-2218.
[2]	许盛伟, 陈诚, 王荣荣. 针对椭圆曲线密码系统点乘算法的改进差分故障攻击[J]. 计算机应用, 2016, 36(12): 3328-3332.
[3]	邵荣. 扩展到整数类型范围的模的模乘算法[J]. 计算机应用, 2012, 32(09): 2470-2471.
[4]	丁燕艳费向东潘郁. 重新认识背包公钥密码的安全性[J]. 计算机应用, 2012, 32(03): 694-698.
[5]	彭元喜杨洪杰谢刚. X-DSP浮点乘法器的设计与实现[J]. 计算机应用, 2010, 30(11): 3121-3125.
[6]	秦宝东孔凡玉. 基于边带信道原子的安全快速椭圆曲线密码点乘算法[J]. 计算机应用, 2009, 29(11): 2983-2986.
[7]	邹候文王锋唐屹 . 椭圆曲线点乘IP核的设计与实现[J]. 计算机应用, 2006, 26(9): 2131-2133.