Abstract: A novel design of Elliptic Curve Cryptography(ECC) IP, using hierarchical method, new point operation scheme and enhanced Montgomery multiplier, is proposed based on ECC over GF(p). It can perform ECC point scalar multiple, point double and point addition/ subtraction operation and support RSA. The IP, under a frequency of 100 MHz, can fulfill 120 and 18 times of point multiple per one second respectively on 256 bit and 521 bit elliptic curve suggested by NIST. The design has passed ASIC synthesis and FPGA verification.

Key words: Elliptic Curve Cryptography(ECC), GF(p), Very Large Scale Integration(VLSI), Montgomery multiple

摘要： 基于素域上的椭圆曲线密码算法，提出一种新型ECC IP的VLSI设计，采用层次化方法，新的点运算策略和改进的Montgomery模乘器，实现了ECC点标量乘、倍点和点加减运算并支持RSA功能。应用NIST推荐的256 bit和521 bit椭圆曲线，每秒分别能运行 120次和18次的点乘运算。设计通过了ASIC综合和FPGA验证。

关键词: 椭圆曲线密码, 素域, 超大规模集成电路, Montgomery模乘

CLC Number: 

• TP309