2011 Fiscal Year Final Research Report
A Study of the Hardness of Algebraic Algorithms and Its Applications to Public-Key Cryptography
| Project/Area Number |
20540125
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
General mathematics (including Probability theory/Statistical mathematics)
|
|---|
| Research Institution | Tokyo Metropolitan University |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2008 – 2011
|
| Keywords | アルゴリズム / 暗号・認証 / 量子コンピュータ |
|---|
| Research Abstract |
We analyzed algebraic algorithms which are computationally intractable. We proposed an improved method for a problem relevant to lattices, an improvement of key-generation algorithm for a homomorphic encryption scheme based on a lattice problem, efficient attacks against some multivariate public-key cryptosystems, and some pairing algorithms. Moreover, based on these analyses, we proposed a multivariate cryptosystem which is expected to be secure against attacks using quantum computers. multivariate public-key cryptosystems, and some pairing algorithms. Moreover, based on these analyses, we proposed a multivariate cryptosystem which is expected to be secure against attacks using quantum computers.
|
