域椭圆曲线点乘的VLSI实现方法研究  

Research and Implementation of Point Multiplication Over Elliptic Curve F_2~m Based on VLSI

作　　者：李超 张强[1] 曲英杰[1] 

机构地区：[1]青岛科技大学信息科学与技术学院,山东青岛266061

出　　处：《计算机测量与控制》2017年第12期232-236,共5页Computer Measurement &Control

基　　金：山东省科技计划项目(2013YD01038)

摘　　要：为了实现椭圆曲线密码算法的高效性,提出了基于优化的底层有限域算法的点乘设计方法;基于对二进制有限域运算的研究,提出并行模乘算法和基于欧几里得算法的右移求逆算法,并在实现中进行优化,在此基础上采用蒙哥马利算法实现点乘的快速运算;根据该算法,提出了ECC硬件电路实现方法,并用Verilog RTL进行逻辑设计,最终在Xilinx的XC7A100TFPGA硬件平台上验证实现;通过仿真测试、综合验证和时序后仿真的结果分析,所设计电路的时钟频率可以达到110 MHz,运算速度可达2.92ms,证明了设计的有效性和可行性。To realize the elliptic curve cryptography （ECC） effectively, the design method of modular muItiplication based on optimized binary finite filed algorithm was presented. By the study of the binary finite fields, paralleled modular multiplication algorithm and inversion algorithm which was based on Euclidean algorithm were presented. The two algorithms were optimized during the process and then realized the fast evaluation of point multiplication by adopting Montgomery algorithm. ECC hardware implementation design was proposed based on the algorithm, and converted to logic designs using Verilog RTL, finally it worked on the XC7A100T FPGA platform of Xilinx. By pre-- simulation, synthetical verification and analyzing the results of post simulation, the clock frequency of the designed circuit could reach up to ll0MHz and the operating rate attained to 2.92 ms which demonstrated the feasibility and effectiveness of the Droiect.

关 键 词：椭圆曲线密码 二进制域 点乘 模乘 模逆 

分 类 号：TN918[电子电信—通信与信息系统]