期刊文献+

可重构点乘运算的FPGA设计 被引量:3

Reconfigurable Point Multiplication Design Based on FPGA
原文传递
导出
摘要 文章在深入分析ECC点乘运算的FPGA实现的基础上,提出了一种参数可重构的、基于正规基有限域运算的ECC点乘运算结构。该点乘运算结构采用了复用、并行化等措施,在FPGA上实现了GF(2^191)的ECC点乘运算。在Altera FPGA上的仿真结果表明:在50Mhz时钟下,一次点乘运算只需413.28us。 Based on the analysis deep into the implementation of ECC point multiplication on FPGA, we propose a reconfigurable ECC point multiplication architecture which is based on the normal basis in finite field. This architecture utilizes many methods which aim at the characteristics of point multiplication, such as reuse, parallelization, etc., finally implement the ECC point multiplication of GF(2^191) on FPGA platform. The simulation on Altera FPGA indicates that, one point multiplication only takes 413.28 us under 50 Mhz clock frequency.
出处 《信息安全与通信保密》 2009年第6期86-87,90,共3页 Information Security and Communications Privacy
关键词 椭圆曲线加密 FPGA 点乘 可配置 ECC FPGA Point Multiplication reconfigurable
  • 相关文献

参考文献7

  • 1Lopez Julio,Dahab Ricardo.Fast Multiplication on Elliptic Curves over GF(2m) without Precomputing[C].In Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems.London,UK:Springer Verlag 1999:316-327.
  • 2Saqib A.Nazar,Henriquez Rodriguez-Francisco,Perez Diaz-Arturo.A Parallel Architecture for Fast Computation of Elliptic Curve Scalar Multiplication over GF(2m)[C].In:Proceedings of the 18th International Parallel and Distributed Processing Symposium,Workshop 3.Santa Fe:IEEE,2004:144a.
  • 3Nassar D,Watheq EI-Kharashi M,Mahmoud Shousha A.E.-H.An FPGA-Based Architecture for ECC Point Multiplication[C].In:International Design and Test Workshop,2007 2nd.Cairo:IEEE,2007:237-238.
  • 4唐薛峰,沈海斌,严晓浪.GF(2^m)上椭圆曲线密码体制的硬件实现[J].计算机工程与应用,2004,40(11):96-98. 被引量:3
  • 5邹候文,王峰,唐屹.椭圆曲线点乘IP核的设计与实现[J].计算机应用,2006,26(9):2131-2133. 被引量:5
  • 6陈韬,郁滨.GF(2^n)域上基于ONB的ECC运算单元设计与实现[J].计算机工程,2007,33(9):168-170. 被引量:1
  • 7Smart N P.The Hessian Form of an Elliptic Curve[C].In Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systens New York:Springer-Verlag,2001:118-125.

二级参考文献18

  • 1朱璇,陈韬,郁滨.F2^n上基于ONB的椭圆曲线乘法器的设计与实现[J].微电子学与计算机,2005,22(7):184-188. 被引量:2
  • 2FIPS 186-2 of NIST. DIGITAL SIGNATURE STANDARD(DSS)[S],2000.
  • 3BROWN M , HANKERSON D , LOPEZ J , et al . Software Implementation of the NIST Elliptic Curves Over Prime Fields[ A].Proc. of CT-RSA'2001[ C]. Springer-Verlag, LNCS 2020, 2001.250 - 265.
  • 4HASAN MA, WANG MZ, BHARGAVA VK. A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields[ J]. IEEE Transactions on Computers, 1993, 42( 11 ) : 1278 - 1280.
  • 5ANSI X9.62, Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA)[S], 1999.
  • 6LOPEZ J, DAHAB R. Fast multiplication on elliptic curves over GF( 2m ) without precomputation [ A ]. CHES'99 Workshop on Cryptographic Hardware and Embedded Systems[ C]. Lecture Notes in Computer Science 1717. Springer-Verlag, 1999.
  • 7ITOH T, TSUFII S. A fast algorithm for computing multiplicative inverse in GF (2m) using normal bases [ J]. Information and Computation, 71998, 8(3) : 171 - 177.
  • 8IEEE P 1363 / D 13 , Standard Specifications for Public Key Cryptography[ S], 1999.93 - 94.
  • 9REYHANI - MASOLEH A , HASAN MA . Low Complexity Word-Level Sequential Normal Basis Multipliers[ J]. IEEE transactions on computers, 2005, 54(2) : 98 - 110.
  • 10JARVINEN K, TOMMISKA M, SKYTrA J. A scalable architecture for elliptic curve point multiplication[ A]. 2004 IEEE International Conference on Field-Programmable Technology, ICFPT 2004[ C],2004.303 - 306.

共引文献6

同被引文献16

引证文献3

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部