Security Evaluation for Elliptic Curve Pairing-based Cryptography with Conjugate Rational Points by Distributed and Parallelized Experiments
| Project/Area Number |
25280047
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (B)
|
| Allocation Type | Partial Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Information security
|
|---|
| Research Institution | Okayama University |
|---|
Principal Investigator |
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
Uehara Satoshi 北九州市立大学, 国際環境工学部, 教授 (90213389)
Kusaka Takuya 岡山大学, 大学院自然科学研究科, 講師 (00336918)
Yamai Nariyoshi 東京農工大学, 工学研究院, 教授 (90210319)
|
|---|
| Project Period (FY) |
2013-04-01 – 2016-03-31
|
| Project Status |
Completed (Fiscal Year 2015)
|
| Budget Amount *help |
¥14,170,000 (Direct Cost: ¥10,900,000、Indirect Cost: ¥3,270,000)
Fiscal Year 2015: ¥4,810,000 (Direct Cost: ¥3,700,000、Indirect Cost: ¥1,110,000)
Fiscal Year 2014: ¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000)
Fiscal Year 2013: ¥4,940,000 (Direct Cost: ¥3,800,000、Indirect Cost: ¥1,140,000)
|
|---|
| Keywords | ペアリング暗号 / 乱数検定 / 攻撃・安全性評価 / 並列処理 / データ解析 |
|---|
| Outline of Final Research Achievements |
In order to evaluate the security of elliptic curve pairing-based cryptography, this research has considered several attacking method, particularly rho method with some improvements and experiments. In detail, this research discussed a random number generator for efficiently carrying out random walks of rational points and then discussed an efficient distributed parallel attacks. Then, this paper also developed some efficient arithmetic operations on elliptic curve and evaluated some other approaches that kept all of generated random rational points for the attack in contrast to rho method. As a result, this research could show that 88 bit pairing-based cryptography could be broken with about three hours computation by 4 PCs. This research still keeps on attacking 114 bit pairing-based cryptography.
|
Report
(4 results)
Research Products
(46 results)
