d-MUL: Optimizing and implementing a multidimensional scalar multiplication algorithm over elliptic curves

dc.contributor.author Hüseyin Hişil
dc.contributor.author Aaron Hutchinson
dc.contributor.author Koray Karabina
dc.contributor.editor A. Chattopadhyay , Y. Yarom , C. Rebeiro
dc.date.accessioned 2025-10-06T17:51:46Z
dc.date.issued 2018
dc.description.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. © 2019 Elsevier B.V. All rights reserved.
dc.identifier.doi 10.1007/978-3-030-05072-6_12
dc.identifier.isbn 9789819698936, 9789819698042, 9789819698110, 9789819698905, 9789819512324, 9783032026019, 9783032008909, 9783031915802, 9789819698141, 9783031984136
dc.identifier.issn 16113349, 03029743
dc.identifier.uri https://www.scopus.com/inward/record.uri?eid=2-s2.0-85058505087&doi=10.1007%2F978-3-030-05072-6_12&partnerID=40&md5=7c75dc43605130bdfb15770d654b4036
dc.identifier.uri https://gcris.yasar.edu.tr/handle/123456789/9613
dc.language.iso English
dc.publisher Springer Verlag service@springer.de
dc.relation.ispartof 8th International Conference on Security Privacy and Applied Cryptography Engineering SPACE 2018
dc.source Lecture Notes in Computer Science
dc.subject D-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, Cryptography
dc.subject Geometry, Addition chains, Cryptographic applications, Elliptic curve, Isochronous implementation, Matrix operations, Parallel implementations, Scalar multiplication, Scalar point multiplication, Cryptography
dc.title d-MUL: Optimizing and implementing a multidimensional scalar multiplication algorithm over elliptic curves
dc.type Conference Object
dspace.entity.type Publication
gdc.bip.impulseclass C5
gdc.bip.influenceclass C5
gdc.bip.popularityclass C5
gdc.coar.type text::conference output
gdc.collaboration.industrial false
gdc.identifier.openalex W2904399066
gdc.index.type Scopus
gdc.oaire.diamondjournal false
gdc.oaire.impulse 2.0
gdc.oaire.influence 2.6308242E-9
gdc.oaire.isgreen false
gdc.oaire.popularity 1.0406959E-9
gdc.oaire.publicfunded false
gdc.openalex.collaboration International
gdc.openalex.fwci 0.9469
gdc.openalex.normalizedpercentile 0.78
gdc.opencitations.count 2
gdc.plumx.mendeley 1
gdc.plumx.scopuscites 3
oaire.citation.endPage 217
oaire.citation.startPage 198
person.identifier.scopus-author-id Hişil- Hüseyin (13408968300), Hutchinson- Aaron (57205098130), Karabina- Koray (24338530800)
project.funder.name 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.
publicationvolume.volumeNumber 11348 LNCS
relation.isOrgUnitOfPublication ac5ddece-c76d-476d-ab30-e4d3029dee37
relation.isOrgUnitOfPublication.latestForDiscovery ac5ddece-c76d-476d-ab30-e4d3029dee37

Files