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
|
Project Status |
Completed (Fiscal Year 2011)
|
Budget Amount *help |
¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000)
Fiscal Year 2011: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2010: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2009: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2008: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
|
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.
|
Report
(6 results)
Research Products
(53 results)
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Journal Article] NZMATH 1.02010
Author(s)
Satoru Tanaka, Naoki Ogura, Ken Nakamula, Tetsushi Matsui, Shigenori Uchiyama
-
Journal Title
Proceedings of the 3^<rd> International Congress on Mathematical Software(ICMS2010)
Volume: LNCS6327
Pages: 260-269
Related Report
Peer Reviewed
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-