| Budget Amount *help |
¥14,040,000 (Direct Cost: ¥10,800,000、Indirect Cost: ¥3,240,000)
Fiscal Year 2019: ¥2,340,000 (Direct Cost: ¥1,800,000、Indirect Cost: ¥540,000)
Fiscal Year 2018: ¥2,340,000 (Direct Cost: ¥1,800,000、Indirect Cost: ¥540,000)
Fiscal Year 2017: ¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000)
Fiscal Year 2016: ¥4,940,000 (Direct Cost: ¥3,800,000、Indirect Cost: ¥1,140,000)
|
|---|
| Outline of Final Research Achievements |
Lattice-based cryptography is a next-generation cryptography that is resistant to quantum computers and is also applicable to construction of high-functional cryptography such as homomorphic encryption. In particular, LWE-based schemes have excellent processing performance. The security of lattice-based cryptography is based on the computational hardness of lattice problems such as the shortest vector problem, but these problems are NP-hard and only known as asymptotic complexity. In this research, we had developed new algorithms to efficiently solve lattice problems such as the shortest vector and the LWE problems, and also evaluated their performance by experiments. Furthermore, we had implemented LWE-based homomorphic encryption schemes and demonstrated the performance in concrete applications such as secure matrix multiplications and secure statistical processing.
|
