Publication:
Performance comparison of some addition chain methods based on integer family

Simple item page
dc.contributor.authorKadir M.F.A.en_US
dc.contributor.authorMohamed M.A.en_US
dc.contributor.authorMohamad R.en_US
dc.contributor.authorMamat M.en_US
dc.contributor.authorMuhammed A.en_US
dc.contributor.authorid56481265700en_US
dc.contributor.authorid57194596063en_US
dc.contributor.authorid57203266940en_US
dc.contributor.authorid35761412000en_US
dc.contributor.authorid25031823000en_US
dc.date.accessioned2023-05-29T07:31:08Z
dc.date.available2023-05-29T07:31:08Z
dc.date.issued2019
dc.descriptionChains; Geometry; Public key cryptography; Addition chains; Competitive performance; Composition method; Computational resources; Elliptic curve cryptography; NP Complete; Performance comparison; Scalar multiplication; Heuristic methodsen_US
dc.description.abstractA generalized version of an addition chain problem, in which one must find a chain that simultaneously satisfies a sequence on integer in ascending order, is NP-complete. There is no known algorithm which can calculate an optimal addition chain for a given number with any guarantees of reasonable timing or small memory usage. Several methods were introduced to calculate relatively short chain and they are most used to support scalar multiplication operation tailored to limited computational resources in elliptic curve cryptography. In reality, one method is no better than the other except on certain occasions and only for specific integers. In this studies, we evaluate some existing addition chain methods against each other for their competitive performance by categorizing integers into various groups as the input. This result can be used as a benchmark for which method is suitable in which condition anticipated. � 2019, Springer Nature Singapore Pte Ltd.en_US
dc.description.natureFinalen_US
dc.identifier.doi10.1007/978-981-13-1056-0_22
dc.identifier.epage218
dc.identifier.scopus2-s2.0-85051080270
dc.identifier.spage211
dc.identifier.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85051080270&doi=10.1007%2f978-981-13-1056-0_22&partnerID=40&md5=597449f7448de90d96a9f5deb5ae17d6
dc.identifier.urihttps://irepository.uniten.edu.my/handle/123456789/25056
dc.identifier.volume514
dc.publisherSpringer Verlagen_US
dc.sourceScopus
dc.sourcetitleLecture Notes in Electrical Engineering
dc.titlePerformance comparison of some addition chain methods based on integer familyen_US
dc.typeConference Paperen_US
dspace.entity.typePublication
Files
Collections
SCOPUS