Fast Scalar Multiplication on Elliptic Curve Cryptography in Selected Intervals Suitable for Wireless Sensor Networks
In Wireless Sensor Networks (WSNs), providing a robust security mechanism with limited energy resources is very challenging because of sensor nodes limited resources.Symmetric-key can fulfill the requirement, but if the number of nodes is large, asymmetric-key cryptog raphy is the best natural method because of its scalability.Asymmetric key cryptography is power-hungry; nevertheless, Elliptic Curve Cryptosystems (ECC) are feasible and more flexible for sensor nodes.Scalar multiplication is the most widely used operation on ECC.Various methods for fast scalar multiplication are based on the binary/ternary representation of the scalar.In this paper, we present a novel technique to make fast scalar multiplication on ECC over prime field for light-weight embedded devices like sensor nodes.Our method significantly reduces the computation of scalar multiplication by an equivalent representation of points based on point order in a given interval.Since our technique can act as a support for most existing methods, after an analytical and effi ciency analysis, we implement and evaluate its performance in different scenarios.
Elliptic Curve Cryptography Fast Scalar Multiplication Wireless Sensor Networks
Youssou Faye Herve Guyennet Ibrahima Niang Yanbo Shou
Femto-st DISC,Franche-Comte University,France Department of Mathematics and Computer Sciences,UCAD University,Senegal
国际会议
The 5th International Symposium on Cyberspace Safety and Security ( CSS2013)(第五届国际网络空间安全和安保研讨会)
张家界
英文
171-182
2013-11-13（万方平台首次上网日期，不代表论文的发表时间）