| An FPGA Implementation of GF （p） Elliptic Curve Cryptographic Coprocessor |
| |
| 作者姓名： | LIUYu-zhen QINZhong-ping ZHANGHuan-guo |
| |
| 作者单位： | [1]SchoolofComputer,WuhanUniversity,Wuhan430072,Hubei,China [2]SchoolofSoftware,HuazhongUniversityofScienceandTechnology,Wuhan430074,Hubei,China |
| |
| 摘 要： | A GF (p) elliptic curve cryptographic coprocessor is proposed and implemented on Field Programmable Gate Array (FPGA). The focus of the coprocessor is on the most critical, complicated and time-consuming point multiplications. The technique of coordinates conversion and fast multiplication algorithm of two large integers are utilized to avoid frequent inversions and to accelerate the field multiplications used in point multiplications. The characteristic of hardware parallelism is considered in the implementation of point multiplications. The coprocessor implemented on XILINX XC2V3000 computes a point multiplication for an arbitrarypoint on a curve defined over GF(2^192-2^64-1) with the frequency of 10 MHz in 4.40 ms in the average case and 5.74ms in the worst case. At the same circumstance, the coprocessor implemented on XILINX XC2V4000 takes 2.2 ms in the average case and 2.88 ms in the worst case.
|
| 关 键 词： | 椭圆曲线密码系统 密码协处理器 密码技术 信息安全 现场可编程门阵列 计算机 |
| 收稿时间： | 28 May 2004 |
An FPGA implementation of GF (p) elliptic curve cryptographic coprocessor |
| |
| LIUYu-zhen QINZhong-ping ZHANGHuan-guo.An FPGA implementation of GF (p) elliptic curve cryptographic coprocessor[J].Wuhan University Journal of Natural Sciences,2005,10(1):31-34. |
| |
| Authors: | Liu Yu-zhen Qin Zhong-ping Zhang Huan-guo |
| |
| Institution: | (1) School of Computer, Wuhan University, 430072, Hubei Wuhan, China;(2) School of Software, Huazhong University of Science and Technology, 430074, Hubei Wuhan, China |
| |
| Abstract: | A GF(p) elliptic curve cryptographic coprocessor is proposed and implemented on Field Programmable Gate Array (FPGA). The focus
of the coprocessor is on the most critical, complicated and time-consuming point multiplications. The technique of coordinates
conversion and fast multiplication algorithm of two large integers are utilized to avoid frequent inversions and to accelerate
the field multiplications used in point multiplications. The characteristic of hardware parallelism is considered in the implementation
of point multiplications. The coprocessor implemented on XILINX XC2V3000 computes a point multiplication for an arbitrary
point on a curve defined over GF(2192−264−1) with the frequency of 10 MHz in 4.40 ms in the average case and 5.74 ms in the worst case. At the same circumstance, the
coprocessor implemented on XILINX XC2V4000 takes 2.2 ms in the average case and 2.88 ms in the worst case.
Foundation item: Supported by the National Natural Science Foundation of China (69973034) and the National High Technology Research and Development
Program of China (2002AA141050)
Biography: Liu Yu-zhen (1963), female, Associate professor, research direction, information security. |
| |
| Keywords: | elliptic curve cryptosystems cryptographic coprocessor cryptography information security |
| 本文献已被 维普 SpringerLink 等数据库收录！ |
