Abstract
This paper aims to answer whether d-MUL, the multidimensional scalar point multiplication algorithm, can be implemented efficiently. d-MUL is known to access costly matrix operations and requires memory access frequently. In the first part of the paper, we derive several theoretical results on the structure and the construction of the addition chains in d-MUL. These results are interesting on their own right. In the second part of the paper, we exploit our theoretical results, and propose an optimized variant of d-MUL. Our implementation results show that d-MUL can be very practical for small d, and it remains as an interesting algorithm to further explore for parallel implementation and cryptographic applications.
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
References
Azarderakhsh, R., Karabina, K.: Efficient algorithms and architectures for double point multiplication on elliptic curves. In: Proceedings of the Third Workshop on Cryptography and Security in Computing Systems, CS2 2016 (2016)
Bernstein, D.: Differential addition chains. Technical report (2006). http://cr.yp.to/ecdh/diffchain-20060219.pdf
Bos, J.W., Costello, C., Hisil, H., Lauter, K.: High-performance scalar multiplication using 8-dimensional GLV/GLS decomposition. In: Bertoni, G., Coron, J.-S. (eds.) CHES 2013. LNCS, vol. 8086, pp. 331–348. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40349-1_19
Brown, D.: Multi-dimensional montgomery ladders for elliptic curves. ePrint Archive: Report 2006/220. http://eprint.iacr.org/2006/220
Costello, C., Longa, P.: Four\(\mathbb{Q}\): four-dimensional decompositions on a \(\mathbb{Q}\)-curve over the mersenne prime. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 214–235. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-48797-6_10
Hisil, H., Wong, K.K.-H., Carter, G., Dawson, E.: Twisted Edwards curves revisited. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 326–343. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-89255-7_20
Hutchinson, A., Karabina, K.: Constructing multidimensional differential addition chains and their applications. J. Cryptogr. Eng. 1–19 (2017). https://doi.org/10.1007/s13389-017-0177-2
Joye, M., Tunstall, M.: Exponent recoding and regular exponentiation algorithms. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS, vol. 5580, pp. 334–349. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-02384-2_21
Montgomery, P.: Speeding the Pollard and elliptic curve methods of factorization. Math. Comput. 48, 243–264 (1987)
Subramanya Rao, S.R.: Three dimensional montgomery ladder, differential point tripling on montgomery curves and point quintupling on Weierstrass’ and Edwards curves. In: Pointcheval, D., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 2016. LNCS, vol. 9646, pp. 84–106. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-31517-1_5
Acknowledgements
The authors would like to thank reviewers for their comments and corrections. Research reported in this paper was supported by the Army Research Office under the award number W911NF-17-1-0311. The content is solely the responsibility of the authors and does not necessarily represent the official views of the Army Research Office.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Hisil, H., Hutchinson, A., Karabina, K. (2018). d-MUL: Optimizing and Implementing a Multidimensional Scalar Multiplication Algorithm over Elliptic Curves. In: Chattopadhyay, A., Rebeiro, C., Yarom, Y. (eds) Security, Privacy, and Applied Cryptography Engineering. SPACE 2018. Lecture Notes in Computer Science(), vol 11348. Springer, Cham. https://doi.org/10.1007/978-3-030-05072-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-030-05072-6_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-05071-9
Online ISBN: 978-3-030-05072-6
eBook Packages: Computer ScienceComputer Science (R0)