2015 Fiscal Year Final Research Report
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
|
| 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.
|
| Free Research Field |
暗号理論
|
