Public-key cryptography suitable for implementation on small device
Project/Area Number |
22500005
|
Research Category |
Grant-in-Aid for Scientific Research (C)
|
Allocation Type | Single-year Grants |
Section | 一般 |
Research Field |
Fundamental theory of informatics
|
Research Institution | University of Tsukuba |
Principal Investigator |
KANAYAMA Naoki 筑波大学, システム情報系, 研究員 (70339696)
|
Co-Investigator(Kenkyū-buntansha) |
OKAMOTO Eiji 筑波大学, システム情報系, 教授 (60242567)
KANAOKA Akira 筑波大学, システム情報系, 助教 (00455924)
MAMBO Masahiro 金沢大学, 電子情報学系, 教授 (60251972)
|
Project Period (FY) |
2010 – 2012
|
Project Status |
Completed (Fiscal Year 2012)
|
Budget Amount *help |
¥4,290,000 (Direct Cost: ¥3,300,000、Indirect Cost: ¥990,000)
Fiscal Year 2012: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2011: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2010: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
|
Keywords | ID ベース暗号 / 楕円曲線 / ペアリング / 合成数位数 / 曲線生成 / 楕円曲線暗号 / ペアリング暗号 / スカラー倍計算 / 等分多項式 / elliptic net / 有限体 / 標数 / ハードウェア / 公開鍵暗号 / supersingular / 超楕円曲線 / 正規化 / Optimal Ateペアリング / 小型デバイス / Millerのアルゴリズム |
Research Abstract |
We worked for developing algorithms for computing pairings and scalar multiplication over elliptic curves in order to implement pairing-based cryptography on IC cards efficiently. We obtained results, for example, about efficient algorithms on computing pairings and scalar multiplication over elliptic curves over finite fields of small characteristic using elliptic nets.
|
Report
(4 results)
Research Products
(15 results)