| 优化正规基域元素乘法的快速计算 |
| |
| 引用本文： | 王红霞,赵宪生,周贇,覃思.优化正规基域元素乘法的快速计算[J].计算机工程,2008,34(24):79-81. |
| |
| 作者姓名： | 王红霞 赵宪生 周贇 覃思 |
| |
| 作者单位： | 1. 成都理工大学信息工程学院,成都,610059
2. 衢州学院信电系,衢州,324000 |
| |
| 基金项目： | 浙江省自然科学基金资助项目(Y105067) |
| |
| 摘 要： | 给出基域GF(2m)上优化正规基域元素乘法的一般计算公式，针对Rosing算法中预计算较多的问题，结合Ning-Yin算法思想，提出一种改进算法和3种预计算方法。与Ning-Yin算法相比，改进算法的效率提高了约20%。
|
| 关 键 词： | 公钥密码体制 优化正规基 域元素乘法 |
| 修稿时间： | |
Efficient Calculation About Finite Field Multiplication in Optimal Normal Basis |
| |
| WANG Hong-xia,ZHAO Xian-sheng,ZHOU Yun,QIN Si.Efficient Calculation About Finite Field Multiplication in Optimal Normal Basis[J].Computer Engineering,2008,34(24):79-81. |
| |
| Authors: | WANG Hong-xia ZHAO Xian-sheng ZHOU Yun QIN Si |
| |
| Affiliation: | (1. College of Information Engineering, Chengdu University of Technology, Chengdu 610059; 2. Department of Information and Electronic, Quzhou College, Quzhou 324000) |
| |
| 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. |
| |
| Keywords: | Elliptic Curve Cryptosystem(ECC) optimal normal basis finite field multiplication |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
|
