Name
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/CANDAR.2015.46 | CANDAR |
Keywords | Field | DocType |
elliptic curve discrete logarithm problem,elliptic curve cryptography security,ECC,computational resources,Web-based volunteer computing,Web-based VC,70-bit ECDLP,execution clients,native client,portable NaCl,PNaCl | Elliptic Curve Digital Signature Algorithm,Elliptic curve discrete logarithm problem,Native client,Computer science,Parallel computing,Elliptic curve cryptography,Volunteer computing | Conference |
ISSN | Citations | PageRank |
2379-1888 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shoma Kajitani | 1 | 0 | 0.34 |
| Yasuyuki Nogami | 2 | 146 | 52.44 |
| Miyoshi, S. | 3 | 0 | 1.01 |
| Thomas H. Austin | 4 | 307 | 15.96 |