{"title":"Strengthening ECDSA Verification Algorithm to be More Suitable to Mobile Networks","authors":"K. K., Narayanasamy P","doi":"10.1109/ICCGI.2006.78","DOIUrl":null,"url":null,"abstract":"The primary objective of the paper is to augment the efficiency of signature process in elliptic curve digital signature algorithm (ECDSA), which turns out to be a bottleneck in mobile devices due to its heavy consumption of resources. An improved algorithm for strengthening the speed of verification process in ECDSA is proposed and evaluated. A comparative study of Comb algorithm with the proposed algorithm for simultaneous multiplication on the NIST-recommended elliptic curves over prime fields is done and a broad analysis of the outcomes is also carried out. Strengthening the pre-computation process with respect to the speed of execution during verification will be the crucial task of this implementation","PeriodicalId":112974,"journal":{"name":"2006 International Multi-Conference on Computing in the Global Information Technology - (ICCGI'06)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Multi-Conference on Computing in the Global Information Technology - (ICCGI'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCGI.2006.78","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
The primary objective of the paper is to augment the efficiency of signature process in elliptic curve digital signature algorithm (ECDSA), which turns out to be a bottleneck in mobile devices due to its heavy consumption of resources. An improved algorithm for strengthening the speed of verification process in ECDSA is proposed and evaluated. A comparative study of Comb algorithm with the proposed algorithm for simultaneous multiplication on the NIST-recommended elliptic curves over prime fields is done and a broad analysis of the outcomes is also carried out. Strengthening the pre-computation process with respect to the speed of execution during verification will be the crucial task of this implementation