Volunteer Computing for Solving an Elliptic Curve Discrete Logarithm Problem

Shoma Kajitani; Yasuyuki Nogami; Shunsuke Miyoshi; Thomas Austin

doi:10.1109/CANDAR.2015.46

Volunteer Computing for Solving an Elliptic Curve Discrete Logarithm Problem

Shoma Kajitani, Yasuyuki Nogami, Shunsuke Miyoshi, Thomas Austin

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Citations (Scopus)

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.

Original language	English
Title of host publication	Proceedings - 2015 3rd International Symposium on Computing and Networking, CANDAR 2015
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	122-126
Number of pages	5
ISBN (Print)	9781467397971
DOIs	https://doi.org/10.1109/CANDAR.2015.46
Publication status	Published - Mar 2 2016
Event	3rd International Symposium on Computing and Networking, CANDAR 2015 - Sapporo, Hokkaido, Japan Duration: Dec 8 2015 → Dec 11 2015

Other

Other	3rd International Symposium on Computing and Networking, CANDAR 2015
Country/Territory	Japan
City	Sapporo, Hokkaido
Period	12/8/15 → 12/11/15

ASJC Scopus subject areas

Computer Science Applications
Computational Theory and Mathematics
Computer Networks and Communications

Access to Document

10.1109/CANDAR.2015.46

Cite this

Volunteer Computing for Solving an Elliptic Curve Discrete Logarithm Problem. / Kajitani, Shoma; Nogami, Yasuyuki; Miyoshi, Shunsuke et al.
Proceedings - 2015 3rd International Symposium on Computing and Networking, CANDAR 2015. Institute of Electrical and Electronics Engineers Inc., 2016. p. 122-126 7424699.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Kajitani, S, Nogami, Y, Miyoshi, S & Austin, T 2016, Volunteer Computing for Solving an Elliptic Curve Discrete Logarithm Problem. in Proceedings - 2015 3rd International Symposium on Computing and Networking, CANDAR 2015., 7424699, Institute of Electrical and Electronics Engineers Inc., pp. 122-126, 3rd International Symposium on Computing and Networking, CANDAR 2015, Sapporo, Hokkaido, Japan, 12/8/15. https://doi.org/10.1109/CANDAR.2015.46

@inproceedings{5217a25d83d942bfa48b7147899e6ec7,

title = "Volunteer Computing for Solving an Elliptic Curve Discrete Logarithm Problem",

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.",

author = "Shoma Kajitani and Yasuyuki Nogami and Shunsuke Miyoshi and Thomas Austin",

year = "2016",

month = mar,

day = "2",

doi = "10.1109/CANDAR.2015.46",

language = "English",

isbn = "9781467397971",

pages = "122--126",

booktitle = "Proceedings - 2015 3rd International Symposium on Computing and Networking, CANDAR 2015",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "3rd International Symposium on Computing and Networking, CANDAR 2015 ; Conference date: 08-12-2015 Through 11-12-2015",

}

TY - GEN

T1 - Volunteer Computing for Solving an Elliptic Curve Discrete Logarithm Problem

AU - Kajitani, Shoma

AU - Nogami, Yasuyuki

AU - Miyoshi, Shunsuke

AU - Austin, Thomas

PY - 2016/3/2

Y1 - 2016/3/2

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84964734912&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84964734912&partnerID=8YFLogxK

U2 - 10.1109/CANDAR.2015.46

DO - 10.1109/CANDAR.2015.46

M3 - Conference contribution

AN - SCOPUS:84964734912

SN - 9781467397971

SP - 122

EP - 126

BT - Proceedings - 2015 3rd International Symposium on Computing and Networking, CANDAR 2015

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 3rd International Symposium on Computing and Networking, CANDAR 2015

Y2 - 8 December 2015 through 11 December 2015

ER -

Volunteer Computing for Solving an Elliptic Curve Discrete Logarithm Problem

Abstract

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this