Cyberspace Safety and Security pp 171-182 | Cite as
Fast Scalar Multiplication on Elliptic Curve Cryptography in Selected Intervals Suitable for Wireless Sensor Networks
Abstract
In Wireless Sensor Networks (WSNs), providing a robust security mechanism with limited energy resources is very challenging because of sensor node’s limited resources. Symmetric-key can fulfill the requirement, but if the number of nodes is large, asymmetric-key cryptography 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 efficiency analysis, we implement and evaluate its performance in different scenarios.
Keywords
Elliptic Curve Cryptography Fast Scalar Multiplication Wireless Sensor NetworksPreview
Unable to display preview. Download preview PDF.
References
- 1.Robshaw, M.J.B., Yin, Y.L.: Elliptic Curve Cryptosystems. An RSA Laboratories Technical Note (revised June 27, 1997)Google Scholar
- 2.Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer Professional Computing. Springer (2004)Google Scholar
- 3.Gordon, D.M.: A survey of fast exponentiation methods. Journal of Algorithms, Academic Press 27(1), 129–146 (1998)CrossRefMATHGoogle Scholar
- 4.Dimitrov, V.S., Imbert, L., Mishra, P.K.: Efficient and secure elliptic curve point multiplication using double-base chains. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 59–78. Springer, Heidelberg (2005)CrossRefGoogle Scholar
- 5.Ciet, M., Joye, M., Lauter, K., Montgomery, P.L.: Trading inversions for multiplications in elliptic curve cryptography. Designs, Codes and Cryptography 39(2), 189–206 (2006)MathSciNetCrossRefMATHGoogle Scholar
- 6.Méloni, N., Hasan, M.A.: Elliptic curve scalar multiplication combining yao’s algorithm and double bases. In: Clavier, C., Gaj, K. (eds.) CHES 2009. LNCS, vol. 5747, pp. 304–316. Springer, Heidelberg (2009)CrossRefGoogle Scholar
- 7.Tian, M., Wang, J., Wang, Y., Xu, S.: An Efficient Elliptic Curve Scalar Multiplication Algorithm Suitable for Wireless Network. In: Second International Conference on Networks Security Wireless Communication and Trusted Computing (NSWCTC), vol. 1, pp. 95–98. IEEE Wuhan, Hubei (2010)CrossRefGoogle Scholar
- 8.Suppakitpaisarn, V., Imai, H., Masato, E.: Fastest Multi-Scalar Multiplication Based on Optimal Double-Base Chains. In: World Congress on Internet Security (WorldCIS 2012), pp. 93–98. IEEE Guelph, ON (2012)Google Scholar
- 9.Rivain, M.: Fast and Regular Algorithms for Scalar Multiplication over Elliptic Curves. Cryptology ePrint Archive, Report 2011/338 (2011), http://eprint.iacr.org/2011/338.pdf
- 10.Bernstein, D.J., Lange, T.: Analysis and optimization of elliptic-curve single-scalar multiplication. Finite Fields and Applications, Contemporary Mathematics Series 461, 1–19 (2008)MathSciNetCrossRefGoogle Scholar
- 11.Longa, P., Miri, A.: Fast and Flexible Elliptic Curve Point Arithmetic over Prime Fields. IEEE Transactions on Computers 57(3), 289–302 (2008)MathSciNetCrossRefGoogle Scholar
- 12.Ansari, B., Wu, H.: Parallel Scalar Multiplication for Elliptic Curve Crypto-systems. In: International Conference on Communications, Circuits and Systems, vol. 1, pp. 71–73. IEEE Computer Society (2005)Google Scholar
- 13.Wu, K., Li, D., Li, H., Yu, C.: Partitioned Computation to Accelerate Scalar Multiplication for Elliptic Curve Crypto-systems. In: 15th International Conference on Parallel and Distributed Systems (ICPADS), pp. 551–555. IEEE, Shenzhen (2009)Google Scholar
- 14.Lim, C.H., Lee, P.J.: More flexible exponentiation with pre-computation. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 95–107. Springer, Heidelberg (1994)Google Scholar
- 15.Shou, Y., Guyennet, H., Lehsaini, M.: Parallel Scalar Multiplication on Elliptic Curves in Wireless Sensor Networks. In: Frey, D., Raynal, M., Sarkar, S., Shyamasundar, R.K., Sinha, P. (eds.) ICDCN 2013. LNCS, vol. 7730, pp. 300–314. Springer, Heidelberg (2013)CrossRefGoogle Scholar