d-MUL: Optimizing and implementing a multidimensional scalar multiplication algorithm over elliptic curves
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, w
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=fbfcdf758f13357d43de0dd088469d29https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10015
Collections
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..