An Improved Secure Elliptic Curve Scalar Multiplication Algorithm over Prime Fields

摘要：

This paper presents a comprehensive approach to accelerate elliptic curve scalar multiplication with unified doubling-addition. Using Melonis formula that efficiently adds two points with the same z-coordinate, we develop an efficient right-to-left double-add algorithm against a large variety of side channel attacks. Comparisons show that our proposed algorithm establishes a faster scalar multiplication.

关键词： elliptic curve cryptosystem scalar multiplication side channel attacks montgomery ladder

作者: Min Tian Yinglong Wang Jizhi Wang Hengjian Li

作者单位: Shandong Provincial Key Laboratory of Computer Network Shandong Computer Science Center Jinan, PR China

会议类型: 国际会议

会议名称: 2010 International Conference on Information Security and Artificial Intelligence(2010年信息安全与人工智能国际会议 ISAI 2010)

会议地点: 成都

会议语种:英文

页码: 1698-1701

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