Hüseyin HişilAaron HutchinsonKoray KarabinaA. Chattopadhyay , Y. Yarom , C. Rebeiro2025-10-0620189789819698936, 9789819698042, 9789819698110, 9789819698905, 9789819512324, 9783032026019, 9783032008909, 9783031915802, 9789819698141, 978303198413616113349, 0302974310.1007/978-3-030-05072-6_12https://www.scopus.com/inward/record.uri?eid=2-s2.0-85058505087&doi=10.1007%2F978-3-030-05072-6_12&partnerID=40&md5=7c75dc43605130bdfb15770d654b4036https://gcris.yasar.edu.tr/handle/123456789/9613This 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. © 2019 Elsevier B.V. All rights reserved.EnglishD-mul, Differential Addition Chain, Elliptic Curve Scalar Multiplication, Isochronous Implementation, Geometry, Addition Chains, Cryptographic Applications, Elliptic Curve, Isochronous Implementation, Matrix Operations, Parallel Implementations, Scalar Multiplication, Scalar Point Multiplication, CryptographyGeometry, Addition chains, Cryptographic applications, Elliptic curve, Isochronous implementation, Matrix operations, Parallel implementations, Scalar multiplication, Scalar point multiplication, CryptographyConference Object