摘要: 给出基域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
中图分类号:
王红霞;赵宪生;周 贇;覃 思. 优化正规基域元素乘法的快速计算[J]. 计算机工程, 2008, 34(24): 79-81.
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.