Web-based Volunteer Computing for Solving the Elliptic Curve Discrete Logarithm Problem

Shoma Kajitani, Y. Nogami, Shunsuke Miyoshi, Thomas H. Austin, Md. Al-Amin Khandaker, Nasima Begum, S. Duquesne
{"title":"Web-based Volunteer Computing for Solving the Elliptic Curve Discrete Logarithm Problem","authors":"Shoma Kajitani, Y. Nogami, Shunsuke Miyoshi, Thomas H. Austin, Md. Al-Amin Khandaker, Nasima Begum, S. Duquesne","doi":"10.15803/IJNC.6.2_181","DOIUrl":null,"url":null,"abstract":"Elliptic curve discrete logarithm problem (ECDLP) is the basis of security of elliptic curve cryptography (ECC). The security evaluation of ECC has been studied by solving an ECDLP. We need a large amount of computational resources for the evaluation. This paper proposes a new system collecting computational resources with Web-based volunteer computing (Web-based VC). In the system, web applications are allocated to volunteer participants (workers) as jobs. Web applications are built by utilizing technologies called Native Client (NaCl) and Portable NaCl (PNaCl). This paper evaluates the performance of the system and solves 70-bit ECDLP with Web-based VC. The performance of the web application utilizing NaCl is approximately 6.4 times higher than that of the web application written in JavaScript. Also, the performance of the web application utilizing PNaCl is approximately 4.2 times higher. In the case of NaCl, 70-bit ECDLP is solved in only 1389 seconds.If we collect 100,000 PCs by Web-based VC, 114-bit ECDLP will be solved in only approximately 1 day.","PeriodicalId":270166,"journal":{"name":"Int. J. Netw. Comput.","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Netw. Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15803/IJNC.6.2_181","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Elliptic curve discrete logarithm problem (ECDLP) is the basis of security of elliptic curve cryptography (ECC). The security evaluation of ECC has been studied by solving an ECDLP. We need a large amount of computational resources for the evaluation. This paper proposes a new system collecting computational resources with Web-based volunteer computing (Web-based VC). In the system, web applications are allocated to volunteer participants (workers) as jobs. Web applications are built by utilizing technologies called Native Client (NaCl) and Portable NaCl (PNaCl). This paper evaluates the performance of the system and solves 70-bit ECDLP with Web-based VC. The performance of the web application utilizing NaCl is approximately 6.4 times higher than that of the web application written in JavaScript. Also, the performance of the web application utilizing PNaCl is approximately 4.2 times higher. In the case of NaCl, 70-bit ECDLP is solved in only 1389 seconds.If we collect 100,000 PCs by Web-based VC, 114-bit ECDLP will be solved in only approximately 1 day.
基于web的志愿计算求解椭圆曲线离散对数问题
椭圆曲线离散对数问题(ECDLP)是椭圆曲线密码(ECC)安全性的基础。通过求解一个ECDLP,研究了ECC的安全性评价。我们需要大量的计算资源来进行评估。本文提出了一种基于web志愿计算的计算资源采集系统。在系统中,web应用程序作为工作分配给志愿参与者(工作者)。Web应用程序是通过使用本地客户端(NaCl)和便携式NaCl (PNaCl)技术构建的。本文对系统的性能进行了评价,并利用基于web的VC解决了70位ECDLP问题。使用NaCl编写的web应用程序的性能大约是使用JavaScript编写的web应用程序的6.4倍。此外,使用PNaCl的web应用程序的性能大约提高了4.2倍。以NaCl为例,70位ECDLP的求解时间仅为1389秒。如果我们通过基于web的VC收集10万台pc, 114位ECDLP将在大约1天内解决。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信