Fast Optimal Normal Basis Multiplier with Type-2kw over GF(2m)

摘要：

Finite field multiplication over GF(2m) is an very important arithmetic operation in elliptic curve cryptosystem (ECC). ECC is an attractive cryptosystem for portable devices such as smart phones. Thus, designs of finite field multiplication with low time complexity or low hardware cost become important research issues in recent years. This study will present a fast optimal normal basis multiplier with Type-2kw over GF(2m). As compared to other existing similar multipliers, our proposed multiplier will save about 18.6％ time complexity on average for NIST suggested m values.

关键词： Elliptic curve cryptosystem finite field arithmetic multiplication systolic array

作者: Che Wun Chiou Jim-Min Lin Chiou-Yng Lee

作者单位: Dept of Computer Science and Information Eng. Ching Yun University, Chung-Li 320 Taiwan, R.O.C. Dept. of Information Eng. and Computer Science Feng Chia University, Taichung City 407 Taiwan, R.O.C Dept. of Computer Information and Network Eng.Lunghwa University of Science and Technology Taoyuan,

会议类型: 国际会议

会议名称: International Conference on Computational Aspects of Social Networks(国际社会网络计算会议 CASoN 2010)

会议地点: 太原

会议语种:英文

页码: 116-120

在线出版日期: 2010-09-26（万方平台首次上网日期，不代表论文的发表时间）