GF（2^m）域高速椭圆曲线加密处理器设计  

Design of a Fast Elliptic Curve Cryptography Processor over GF（2^m）

作　　者：但永平[1] 邹雪城[1] 刘政林[1] 韩煜[1] 易立华[1] 

机构地区：[1]华中科技大学电子科学与技术系,湖北武汉430007

出　　处：《微电子学与计算机》2008年第8期17-21,共5页Microelectronics & Computer

基　　金：国家"八六三"计划项目(2006AA01Z226)

摘　　要：针对高速椭圆曲线加密应用的要求,设计了一种多项式基表示的有限域GF(2m)上的高速椭圆加密处理器.为提高运算速度,点加和倍点模块并行运算,且分别采用全并行结构实现;为减少资源,初始化和最后的坐标变换求逆模块通过优化分解成一系列乘和加运算,合并在一个模块中用串行结构实现.Xilinx公司的VirtexEXCV2600 FPGA硬件实现结果表明,完成有限域GF(2163)上任意椭圆曲线上的一次点乘的全部运算时间消耗约为31.6μs,适合高速椭圆曲线加密应用的要求.In this paper, a high performance elliptic curve cryptography processor over GF（2^m） in polynomial basis representation was proposed. In order to speed up the computational time, the point addition module and point doubling module were optimized and realized in Parallel. For the purpose of minimize the resource, initialization and the final coordinations conversation inversion module were decomposed into a series of multiplication and addition computations, which can merge into a module finally. The implementation results based on Xilinx VirtexE XCV2600 FPGAs show that our proposed design is able to compute general GF（2163） elliptic curve scalar multiplication whole operations in 31.6ps, which implied the proposed architecture is suitable for high-performance cryptosystem application.

关 键 词：椭圆曲线加密 点乘 硬件实现 高速 

分 类 号：TN402[电子电信—微电子学与固体电子学]