ANALYSIS THE MONTGOMERY LADDER ALGORITHM FOR ELLIPTIC CURVES OVER TERNARY FIELDS

摘要：

　　Point multiplication is the dominant cost operation in elliptic curve cryptographic schemes.Montgomery ladder algorithm is one of the methods of speeding up point multiplication.It is originally proposed for elliptic curves over binary fields.In this paper,we consider the Montgomery ladder algorithm for elliptic curves over ternary fields.We propose a new Montgomery ladder algorithm and compare the performance with other algorithms.With the experimental data,we find that the Montgomery ladder algorithm doesnt have advantages in speed.Moreover,we give the reason why the Montgomery ladder algorithm performs badly over ternary fields while performs well over binary fields.

关键词： Elliptic Curve Point Multiplication Montgomery Ladder Algorithm Ternary Field

作者: Haihua Gu Wenlu Xie Ray C.C.Cheung

作者单位: ShangHai Huahong Integrated Circuit Co.,Ltd., 201203 Shanghai, China;Computer Science and Engineerin ShangHai Huahong Integrated Circuit Co.,Ltd., 201203 Shanghai, China Department of Electronic Engineering, City University of Hong Kong, Hong Kong, China

会议类型: 国际会议

会议名称: 2013 International Conference on Information and Network Security(2013信息与网络安全国际会议)

会议地点: 北京

会议语种:英文

页码: 126-130

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