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

Shoma Kajitani (1) , Yasuyuki Nogami (1) , Shunsuke Miyoshi (1) , Thomas Austin (2) , Khandaler Md Al-Amin (1) , Nasima Begum (1) , Sylvain Duquesne (3, 4)

1 Okayama University
2 SJSU - San Jose State University [San Jose]
3 LIRIMA - Laboratoire International de Recherche en Informatique et Mathématiques Appliquées
4 IRMAR - Institut de Recherche Mathématique de Rennes

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.

Mots clés: Elliptic curve cryptography; web-based VC; native client; Discrete logarithm problem

Domaines: Cryptographie et sécurité [cs.CR]

Shoma Kajitani, Yasuyuki Nogami, Shunsuke Miyoshi, Thomas Austin, Khandaler Md Al-Amin, et al.. Web-based Volunteer Computing for Solving the Elliptic Curve Discrete Logarithm Problem. International Journal of Networking and Computing, 2016, 6 (2), pp.181-194. ⟨hal-01540017⟩