Title :
Volunteer Computing for Solving an Elliptic Curve Discrete Logarithm Problem
Author :
Shoma Kajitani;Yasuyuki Nogami;Shunsuke Miyoshi;Thomas Austin
Abstract :
Elliptic curve discrete logarithm problem (ECDLP) is the base of the security of elliptic curve cryptography (ECC). The verification of the security of ECC has been studied by solving an ECDLP. However, we need a large amount of computational resources for the verification. Then, this paper proposes a method gathering computational resources with Web-based Volunteer Computing (Web-based VC). This paper solves 70-bit ECDLP, and evaluates the computational performance of 2 types of the execution clients: Native Client (NaCl) and Portable NaCl (PNaCl). In the case of NaCl, 70-bit ECDLP was solved in 3086 seconds. On the other hand, in the case of PNaCl, 70-bit ECDLP was solved in 6583 seconds.
Keywords :
"Browsers","Elliptic curve cryptography","Computer applications","Distributed processing","Web servers","Databases"
Conference_Titel :
Computing and Networking (CANDAR), 2015 Third International Symposium on
Electronic_ISBN :
2379-1896
DOI :
10.1109/CANDAR.2015.46