Web-based Volunteer Computing for Solving the Elliptic Curve Discrete Logarithm Problem
Web-based Volunteer Computing for Solving the Elliptic Curve Discrete Logarithm Problem
复制标题
基于网络的志愿计算求解椭圆曲线离散对数问题
DOI：
10.15803/ijnc.6.2_181
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
S. Duquesne
中科院分区：
文献类型：
--
作者：
Shoma Kajitani;Y. Nogami;Shunsuke Miyoshi;Thomas H. Austin;Md. Al;Nasima Begum;S. Duquesne
椭圆曲线离散对数问题（ECDLP）是椭圆曲线密码体制（ECC）安全性的基础.通过求解一个椭圆曲线密码问题，研究了椭圆曲线密码体制的安全性评估问题。我们需要大量的计算资源进行评估。提出了一种基于Web的志愿者计算（Web-based VC）的计算资源收集系统。在该系统中，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天即可解决。
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.