Abstract
In a recent paper [10], Mishra and Dimitrov have proposed a window-based Elliptic Curve (EC) scalar multiplication using double-base number representation. Their methods were rather heuristic. In this paper, given the window lengths w 2 and w 3 for the bases 2 and 3, we first show how to fix the number of windows, ρ, and then obtain a Double Base Number System (DBNS) representation of the scalar n suitable for window-based EC scalar multiplication. Using the DBNS representation, we obtain our first algorithm that uses a small table of precomputed EC points. We then modify this algorithm to obtain a faster algorithm by reducing the number of EC additions at the cost of storing a larger number of precomputed points in a table. Explicit constructions of the tables are also given.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Avanzi, R.M., Cohen, H., Doche, C., Frey, G., Langue, T., Nguyen, K., Vercauteren, F.: Handbook of Elliptic and Hyperelliptic Curve Cryptography. CRC press, Boca Raton, USA (2005)
Ciet, M., Lauter, K., Joye, M., Montgomery, P.L.: Trading inversions for multiplications in elliptic curve cryptography. Designs, Codes and Cryptography 39(2), 189–206 (2006)
Cohen, H., Miyaji, A., Ono, T.: Efficient Elliptic Curve Exponentiation Using Mixed coordinates. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 51–65. Springer, Heidelberg (1998)
Dahab, R., Lopez, J.: An Improvement of Guajardo-Paar Method for Multiplication on non-supersingular Elliptic Curves. In: SCCC 1998. Proceedings of the XVIII International Conference of the Chilean Computer Science Society, November 12-14, pp. 91–95. IEEE Computer Society Press, Los Alamitos (1998)
Dimitrov, V., Gullien, G.A., Miller, W.C.: An algorithm for modular exponentiation. Information Processing Letters 66(3), 155–159 (1998)
Dimitrov, V., Imbert, L., Mishra, P.K.: Efficient and Secure Curve Point Multiplication Using Double Base Chain. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 59–79. Springer, Heidelberg (2005)
Doche, C., Imbert, L.: Extended Double-Base Number System with Applications to Elliptic Curve Cryptography. In: Barua, R., Lange, T. (eds.) INDOCRYPT 2006. LNCS, vol. 4329, pp. 335–348. Springer, Heidelberg (2006)
Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, New York (2004)
Itoh, K., Takenaka, M., Torii, N., Temma, S., Kurihara, Y.: Fast implementation of public-key cryptography on a DSP TMS320C6201. In: Koç, Ç.K., Paar, C. (eds.) CHES 1999. LNCS, vol. 1717, p. 6172. Springer, Heidelberg (1999)
Mishra, P.K., Dimitrov, V.: Window-Based Elliptic Curve Scalar Multiplication using Double Base Number Representation, Short Papers, Inscrypt (2007)
Mishra, P.K., Dimitrov, V.: Efficient Quintuple Formulas for Elliptic Curves and Efficient Scalar Multiplication using Multibase Number Representation, ePrint archive. In report 2007/040 (2007), http://www.iacr.org
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barua, R., Pandey, S.K., Pankaj, R. (2007). Efficient Window-Based Scalar Multiplication on Elliptic Curves Using Double-Base Number System. In: Srinathan, K., Rangan, C.P., Yung, M. (eds) Progress in Cryptology – INDOCRYPT 2007. INDOCRYPT 2007. Lecture Notes in Computer Science, vol 4859. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77026-8_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-77026-8_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77025-1
Online ISBN: 978-3-540-77026-8
eBook Packages: Computer ScienceComputer Science (R0)