Huseyin HisilAaron HutchinsonKoray KarabinaKarabina, KorayHisil, HuseyinHutchinson, AaronA ChattopadhyayC RebeiroY Yarom2025-10-062018978-3-030-05072-6, 978-3-030-05071-9978303005071997830300507260302-97431611-334910.1007/978-3-030-05072-6_122-s2.0-85058505087http://dx.doi.org/10.1007/978-3-030-05072-6_12https://gcris.yasar.edu.tr/handle/123456789/6950https://doi.org/10.1007/978-3-030-05072-6_12This 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.Englishinfo:eu-repo/semantics/closedAccessd-MUL, Elliptic curve scalar multiplication Differential addition chain, Isochronous implementationD-mulElliptic Curve Scalar MultiplicationElliptic Curve Scalar Multiplication Differential Addition ChainIsochronous ImplementationDifferential Addition ChainConference Object