计算机工程 ›› 2008, Vol. 34 ›› Issue (24): 79-81.doi: 10.3969/j.issn.1000-3428.2008.24.028

• 软件技术与数据库 • 上一篇    下一篇

优化正规基域元素乘法的快速计算

王红霞1,赵宪生1,周 贇2,覃 思1   

  1. (1. 成都理工大学信息工程学院,成都610059;2. 衢州学院信电系,衢州 324000)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-12-20 发布日期:2008-12-20

Efficient Calculation About Finite Field Multiplication in Optimal Normal Basis

WANG Hong-xia1, ZHAO Xian-sheng1, ZHOU Yun2, QIN Si1   

  1. (1. College of Information Engineering, Chengdu University of Technology, Chengdu 610059; 2. Department of Information and Electronic, Quzhou College, Quzhou 324000)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-12-20 Published:2008-12-20

摘要: 给出基域GF(2m)上优化正规基域元素乘法的一般计算公式,针对Rosing算法中预计算较多的问题,结合Ning-Yin算法思想,提出一种改进算法和3种预计算方法。与Ning-Yin算法相比,改进算法的效率提高了约20%。

关键词: 公钥密码体制, 优化正规基, 域元素乘法

Abstract: This paper gives the general formula of finite field multiplication in optimal normal basis. Toward the trouble of precomputation in Rosing, by adopting Ning-Yin algorithm idea, it puts forward an improved algorithm and three precomputation methods. As a result, the new algorithm improves its efficiency by about 20% compared with Ning-Yin algorithm.

Key words: Elliptic Curve Cryptosystem(ECC), optimal normal basis, finite field multiplication

中图分类号: