2009 Fiscal Year Final Research Report
Computing pairings on curves and their application to cryptography
| Project/Area Number |
19700005
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | University of Tsukuba |
|---|
Principal Investigator |
KANAYAMA Naoki University of Tsukuba, 大学院・システム情報工学研究科, 研究員 (70339696)
|
|---|
| Project Period (FY) |
2007 – 2009
|
| Keywords | (超)楕円曲線 / ペアリング関数 / IDベース暗号 / Tateペアリング / ペアリング逆問題 / Millerアルゴリズム |
|---|
| Research Abstract |
We researched on pairings over (hyper-)elliptic curves. Pairings are used ID-based cryptosystems. However, pairing computation needs large costs comparing to other cryptosystems. In this research, we gave some efficient pairing computation method. Furthermore, we gave a consideration on pairing inversion problem.
|
Research Products
(6 results)
