加强ECDSA验证算法使其更适合移动网络

K. K., Narayanasamy P
{"title":"加强ECDSA验证算法使其更适合移动网络","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":"{\"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}","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

摘要

本文的主要目标是提高椭圆曲线数字签名算法(ECDSA)中签名过程的效率,该算法因其大量消耗资源而成为移动设备的瓶颈。提出了一种提高ECDSA验证速度的改进算法,并对其进行了评价。将梳子算法与提出的算法在nist推荐的素域椭圆曲线上同时乘法进行了比较研究,并对结果进行了广泛的分析。在核查期间的执行速度方面加强预计算过程将是这一实施的关键任务
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Strengthening ECDSA Verification Algorithm to be More Suitable to Mobile Networks
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
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信