抄録
Offer Organization: Japan Society for the Promotion of Science, System Name: Grants-in-Aid for Scientific Research Grant-in-Aid for Research Activity Start-up, Category: Grant-in-Aid for Research Activity Start-up, Fund Type: -, Overall Grant Amount: - (direct: 1600000, indirect: 480000)
In this research project, we focused on security evaluation for the practical use of post-quantum cryptography (PQC). In particular, we developed and improved several decoding algorithms for the approximation of shortest vector problem (SVP), which is the security evidence for lattice-based cryptography, one of the most promising candidates for PQC. We achieved a world record of 158 dimensions in the SVP decoding challenge organized by the Technical University of Darmstadt, Germany. Furthermore, we also improved ENUM (a lattice search algorithm) and Tuple Sieve (a sieve method) to reduce their computational and memory costs, respectively. In addition, we evaluated the security of random number reuse attacks against the lattice-based CRYSTALS-KYBER and SABER. As a result, we obtained a 100% success rate while the number of queries was less than 6.