An FPGA Implementation of GF（p） Elliptic Curve Cryptographic Coprocessor
会议名称：《The 1st Chinese Conference on Trusted Computing and Information Security》
会议日期：2005年
学科分类：0809[工学-电子科学与技术（可授工学、理学学位）] 080902[工学-电路与系统] 08[工学]
基 金：Supported by the National Natural Science Foundation of China (69973034) the National High Technology Research and Development Program of China (2002AA141050)
关 键 词：elliptic curve cryptosystems cryptographic coprocessor cryptography information security
摘 要：正 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.