...
首页> 外文期刊>International Journal of Networking and Computing >Web-based Volunteer Computing for Solving the Elliptic Curve Discrete Logarithm Problem
【24h】

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

机译:基于网络的志愿者计算,解决椭圆曲线离散对数问题

获取原文
           

摘要

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.
机译:椭圆曲线离散对数问题(ECDLP)是椭圆曲线密码学(ECC)安全性的基础。已通过解决ECDLP研究了ECC的安全性评估。我们需要大量的计算资源进行评估。本文提出了一个新的系统,该系统使用基于Web的志愿者计算(基于Web的VC)来收集计算资源。在该系统中,Web应用程序作为工作分配给志愿者(工作人员)。 Web应用程序是利用称为本机客户端(NaCl)和可移植NaCl(PNaCl)的技术构建的。本文评估了系统的性能,并使用基于Web的VC解决了70位ECDLP。使用NaCl的Web应用程序的性能大约是用JavaScript编写的Web应用程序的性能的6.4倍。同样,利用PNaCl的Web应用程序的性能大约高4.2倍。如果使用NaCl,仅需1389秒即可解决70位ECDLP。如果使用基于Web的VC收集100,000台PC,则仅需1天即可解决114位ECDLP。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号