期刊文献+

点乘运算中整数表示方法研究 被引量:5

The Research of the Denotation Methods of Integer in the Point- Multiplication
在线阅读 下载PDF
导出
摘要 在椭圆曲线密码算法中,整数的表示方法在很大程度上决定了点乘运算的效率。本文对目前已有的整数表示方法(如NAF、窗口法、整数拆分等方法)进行了系统的研究,比较了它们的优劣,指出了它们的本质,即用不同的表示方法来减少整数的表示式中非零元的个数,以减少点乘运算中点加运算的次数。 In the arithmetic of elliptic curves, the denotation methods of integer are very important. In this paper, we have a system research to some methods denotation of the integer, and have a compare to these methods, point out their essential that is cutting down the nonzero of the denotations to reduce the numbers of point-addion operation in the point-muhiplication operation.
出处 《微计算机信息》 北大核心 2006年第03X期240-242,共3页 Control & Automation
基金 河南省杰出青年科学基金资助项目(0312001800)
关键词 椭圆曲线 点乘运算 窗口法 elliptic curves, point-multiplication, windows methods.
  • 相关文献

参考文献5

  • 1M.Brown, D.Hankerson, J.Lopez, and A.Menezes.Software Implementation of the NIST Elliptic Curves Over Prime Fields,2001.
  • 2Henri Cohen,Atsuko Miyaji,Takatoshi Ono.Efficient Elliptic Curve Exponentiation Using Mixed Coordinates.Advances in Cryptology-Asiacrypt 98, 1998.
  • 3Kenji Koyama, Yukio Tsuruoka.Speeding Up Elliptic Cryptosystems Using a Signed Binary Window Method.Crypto 92,1992.
  • 4王华,汶德胜.浮点除法运算在TMS320C3X DSP中的实现[J].微计算机信息,2005,21(08Z):88-89. 被引量:4
  • 5R.Gallant,R.Lambert,S.Vanstone.Faster Point Multiplication on Elliptic Curves with Efficient Endomorphism, 2000.

二级参考文献1

  • 1TI Co.TMS320C3X User's Guide. TI corporation, 1997.

共引文献3

同被引文献21

  • 1MENEZES A J,OKAMOTO T,VANSTONE S A. Reducing elliptic curve logarithms in a finite field[J]. Transaction on Informarion Theory, 1993,39:1 639-1 646.
  • 2MILLER V S. Use of elliptic curves in cryptography[ C]. Advances in Cryptology-CRYPTO' 85, Lecture Notes in Computer Science, 1985,218:417-426.
  • 3REN Yanli, GU Dawu. Fully CCA2 secure identity based broadcast encryption without random oracles[J]. Information Processing Letters, 2009,109 ( 11 ) :527-533.
  • 4CAO Feng, CAO Zhenfu. A secure identity-based proxy multi-signature scheme[ J]. Information Sciences, 2009,179:292- 302.
  • 5YU Fangchung, LEE Hsiu hui, LAI Feipei, et al. Access control in user hierarchy based on elliptic curve cryptosystem[ J ]. Information Sciences, 2008,178:230-243.
  • 6BLAKE I F, MURTY V K, XU G. Refinement of Miller's algorithm for computing the Weil/Tate pairing[ J ]. Journal of Algorithms, 2006,58 : 134-149.
  • 7LIU Chaoliang, HORNG Gwoboa, CHEN Teyu. Further refinement of pairing computation based on Miller's algorithm [ J ]. Applied Mathematics and Computation, 2007,189:395-409.
  • 8裴定一,祝跃飞.算法数论[M].北京:科学出版社,2005:102-103.
  • 9Miller V.S.,Use of Elliptic Curves in cryptography[A].Ad2 vances in Cryptology -CRYPTO'85 Proceedings[C]. Springer2Verlag,1986,417-4261
  • 10Koblitz N.Elliptic Curve Cryptosystems[J]. mathematics of communication,1987,48(177):203-209.

引证文献5

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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