期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于DSP TMS320C6201芯片的ECC实现

Implementation of ECC with DSP TMS320C6201 Chip
下载PDF
导出
摘要 针对TI公司的DSPTMS320C6201芯片,对OEF上ECC实现技术作了一定的探讨。研究表明,适当选取OEF参数,相同尺寸的OEF上ECC同素域GF(p)上ECC相比,具有一定的速度优势,更适合DSPTMS320C6201芯片的实现。 This paper makes some research on the implementation of ECC over OEF, with the DSP TMS320C6201 chip of TI company. The article shows that with proper parameters of OEF, the implementation of OEF＇s ECC on DSP TMS320C6201 chip is more efficient than that of prime filed GF（p）.
作者 赵涛 潘晓东 王春迎 顾纯祥
机构地区 解放军信息工程大学信息工程学院 河南省农村科学技术开发中心
出处 《计算机工程》 CAS CSCD 北大核心 2006年第10期161-163,共3页 Computer Engineering
基金 国家"973"计划基金资助项目(G1999035804) 河南省杰出青年基金资助项目(0212001400)
关键词 椭圆曲线公钥密码 OEF DSP TMS320C6201芯片 Elliptic curve cryptosystem Optimal extension fields（OEF） DSP TMS320C6201chip
分类号 TP309 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献5

  • 1Institute of Electrical and Electronics Engineers.IEEE P1363-1999.Standards for Public-key Cryptography[S].1999.
  • 2Bailey D V,Paar C.Efficient Arithmetic in Finite Field Extensions with Application in Elliptic Curve Cryptography[J].J.Cryptology,2001,14(3):153-176.
  • 3Sakai Y,Sakurai K.Efficient Scalar Multiplications on Elliptic Curves Without Repeated Doublings and Their Practical Performance[C].Proc.of the 5th Australasian Conference on Information Security and Privacy.Berlin:Springer-Verlag,2000.
  • 4祝跃飞,顾纯祥,裴定一.SEA算法的有效实现[J].软件学报,2002,13(6):1155-1161. 被引量：5
  • 5Brown M,Hankerson D,Lopez J,et al.Software Implementation of the NIST Elliptic Curves Over the Prime Fields[C].Proc.of the 2001Conference on Topics in Cryptology:the Crytographer's Track at RSA.Berlin:Springer-Verlag,2001.

二级参考文献16

  • 1ANSI X9.62-1998. The Elliptic Curve Digital Signature Algorithm (ECDSA). Public Key Cryptography for the Financial Service Industry, American Bankers Association, 1998.
  • 2ANSI X9.63-1999. Key Agreement and Key Transport Using Elliptic Curve Cryptography. Public Key Cryptography for the Financial Service Industry, American Bankers Association, 1999.
  • 3IEEE P1363. Standards for Public-Key Cryptography. Institute of Electricaland Electronics Engineers, 1999.
  • 4SEC1. Elliptic Curve Cryptography. Standards for Efficient Cryptography Group, 1999.
  • 5FIPS 186-2. Digital Signature Standard. Federal Information Processing Standards, 2000.
  • 6Schoof, R. Counting points on elliptic curves over finite fields. Journal of Theorie des Nombres de Bordeaux, 1995,7:219～254.
  • 7Atkin, A.O. The number of points on an elliptic curve modulo a prime. Series of e-mail to the NMBRTHRY mailing list, 1992.
  • 8Elkies, N.D. Elliptic and modular curves over finite fields and related computational issues. In: Buell, D.A., Teitelbaum, J.T., eds. Coputational Perspective on Number Theory. AMS/International Press, 1998. 21～76.
  • 9Couveignes, J.-M., Morain, F. Schoof's algorithm and isogeny cycles. In: Adleman, L.M., Huang, M.D., eds. ANTS-I. LNCS 877, Springer-Verlag, 1994. 43～5.
  • 10Lecier, R., Morain, F. Counting the number of points on elliptic curves over finite fields: strategy and performances. In: Guillou, L.C., Quisquater, J.J., eds. Proceedings of the EUROCRYPT'95. LNCS 921, Springer-Verlag, 1995. 79～94.

共引文献4

计算机工程
2006年 第10期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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