首页 | 本学科首页   官方微博 | 高级检索  
     

素域上椭圆曲线密码IP的高效VLSI实现
引用本文:朱华,周玉洁.素域上椭圆曲线密码IP的高效VLSI实现[J].计算机工程,2008,34(16):165-167.
作者姓名:朱华  周玉洁
作者单位:上海交通大学电子工程系,上海,200240
摘    要:基于素域上的椭圆曲线密码算法,提出一种新型ECC IP的VLSI设计,采用层次化方法,新的点运算策略和改进的Montgomery模乘器,实现了ECC点标量乘、倍点和点加减运算并支持RSA功能。应用NIST推荐的256 bit和521 bit椭圆曲线,每秒分别能运行 120次和18次的点乘运算。设计通过了ASIC综合和FPGA验证。

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

Effective VLSI Implementation for Elliptic Curve Cryptography IP over GF(p)
ZHU Hua,ZHOU Yu-jie.Effective VLSI Implementation for Elliptic Curve Cryptography IP over GF(p)[J].Computer Engineering,2008,34(16):165-167.
Authors:ZHU Hua  ZHOU Yu-jie
Affiliation:(Department of Electronic Engineering, Shanghai Jiaotong University, Shanghai 200240)
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.
Keywords:Elliptic Curve Cryptography(ECC)  GF(p)  Very Large Scale Integration(VLSI)  Montgomery multiple
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号