Analysis of algebraic algorithms and its applications to public-key cryptography
Project/Area Number |
24540135
|
Research Category |
Grant-in-Aid for Scientific Research (C)
|
Allocation Type | Multi-year Fund |
Section | 一般 |
Research Field |
General mathematics (including Probability theory/Statistical mathematics)
|
Research Institution | Tokyo Metropolitan University |
Principal Investigator |
|
Project Period (FY) |
2012-04-01 – 2016-03-31
|
Project Status |
Completed (Fiscal Year 2015)
|
Budget Amount *help |
¥5,070,000 (Direct Cost: ¥3,900,000、Indirect Cost: ¥1,170,000)
Fiscal Year 2015: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2014: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2013: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2012: ¥1,820,000 (Direct Cost: ¥1,400,000、Indirect Cost: ¥420,000)
|
Keywords | 暗号 / アルゴリズム |
Outline of Final Research Achievements |
In this research, we consider that analysis of algebraic algorithms from computational complexity and its applications to public-key cryptography, especially pairing based cryptography. We mainly gave the following results: A proposal of improving a pairing computation algorithm based on elliptic nets and hyperelliptic nets. A proposal of some computational hard problem based on elliptic divisibility sequences, which is equivalent to DH problem. A proposal of some improvement of scalar multiplication on Edward curves.
|
Report
(5 results)
Research Products
(26 results)