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

研究成果

2 被引用数 (Scopus)

抄録

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.

本文言語	English
ホスト出版物のタイトル	Proceedings - 2015 3rd International Symposium on Computing and Networking, CANDAR 2015
出版社	Institute of Electrical and Electronics Engineers Inc.
ページ	122-126
ページ数	5
ISBN（印刷版）	9781467397971
DOI	https://doi.org/10.1109/CANDAR.2015.46
出版ステータス	Published - 3月 2 2016
イベント	3rd International Symposium on Computing and Networking, CANDAR 2015 - Sapporo, Hokkaido 継続期間: 12月 8 2015 → 12月 11 2015

Other

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

ASJC Scopus subject areas

コンピュータサイエンスの応用
計算理論と計算数学
コンピュータネットワークおよび通信

文献へのアクセス

10.1109/CANDAR.2015.46

他のファイルとリンク

引用スタイル

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

抄録

Other

ASJC Scopus subject areas

文献へのアクセス

他のファイルとリンク

フィンガープリント

引用スタイル