WEKO3
-
RootNode
アイテム
Experimental Analysis of Cheon's Algorithm against Pairing-friendly Curves
https://ipsj.ixsq.nii.ac.jp/records/77497
https://ipsj.ixsq.nii.ac.jp/records/77497e03f5eae-414d-4968-960f-8f1f12d50437
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL5209015.pdf (234.5 kB)
|
Copyright (c) 2011 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 2011-09-15 | |||||||
| タイトル | ||||||||
| タイトル | Experimental Analysis of Cheon's Algorithm against Pairing-friendly Curves | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | Experimental Analysis of Cheon's Algorithm against Pairing-friendly Curves | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | 特集：人と共存するコンピュータセキュリティ技術 | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| 著者所属 | ||||||||
| FUJITSU LABORATORIES LTD. | ||||||||
| 著者所属 | ||||||||
| FUJITSU LABORATORIES LTD. | ||||||||
| 著者所属 | ||||||||
| FUJITSU LABORATORIES LTD. | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| FUJITSU LABORATORIES LTD. | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| FUJITSU LABORATORIES LTD. | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| FUJITSU LABORATORIES LTD. | ||||||||
| 著者名 |
Tetsuya, Izu
Masahiko, Takenaka
Masaya, Yasuda
× Tetsuya, Izu Masahiko, Takenaka Masaya, Yasuda
|
|||||||
| 著者名(英) |
Tetsuya, Izu
Masahiko, Takenaka
Masaya, Yasuda
× Tetsuya, Izu Masahiko, Takenaka Masaya, Yasuda
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | Let G be an additive group generated by an element G of prime order r. The discrete logarithm problem with auxiliary input (DLPwAI) is a problem to find α on inputs G, αG, αdG ∈ G for a positive integer d dividing r-1. The infeasibility of DLPwAI ensures the security of some pairing-based cryptographic schemes. In 2006, Cheon proposed an algorithm for solving DLPwAI which works better than conventional algorithms. In this paper, we report our experimental results of Cheon's algorithm on a pairing-friendly elliptic curve defined over GF(3 127). Moreover, based on our experimental results, we estimate the required cost of Cheon's algorithm to solve DLPwAI on some pairing-friendly elliptic curves over a finite field of characteristic 3. Our estimation implies that DLPwAI on a part of pairing-friendly curves can be solved at reasonable cost when the optimal parameter d is chosen. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | Let G be an additive group generated by an element G of prime order r. The discrete logarithm problem with auxiliary input (DLPwAI) is a problem to find α on inputs G, αG, αdG ∈ G for a positive integer d dividing r-1. The infeasibility of DLPwAI ensures the security of some pairing-based cryptographic schemes. In 2006, Cheon proposed an algorithm for solving DLPwAI which works better than conventional algorithms. In this paper, we report our experimental results of Cheon's algorithm on a pairing-friendly elliptic curve defined over GF(3 127). Moreover, based on our experimental results, we estimate the required cost of Cheon's algorithm to solve DLPwAI on some pairing-friendly elliptic curves over a finite field of characteristic 3. Our estimation implies that DLPwAI on a part of pairing-friendly curves can be solved at reasonable cost when the optimal parameter d is chosen. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AN00116647 | |||||||
| 書誌情報 |
情報処理学会論文誌 巻 52, 号 9, p. 2652-2661, 発行日 2011-09-15 |
|||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1882-7764 | |||||||
