摘要
给出基域GF(2m)上优化正规基域元素乘法的一般计算公式,针对Rosing算法中预计算较多的问题,结合Ning-Yin算法思想,提出一种改进算法和3种预计算方法。与Ning-Yin算法相比,改进算法的效率提高了约20%。
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.
出处
《计算机工程》
CAS
CSCD
北大核心
2008年第24期79-81,共3页
Computer Engineering
基金
浙江省自然科学基金资助项目(Y105067)
关键词
公钥密码体制
优化正规基
域元素乘法
Elliptic Curve Cryptosystem（ECC）
optimal normal basis
finite field multiplication
