Security Analysis of Public-Key Cryptography by Large-Scale Experiments

点击翻译按钮获取中文摘要

The security of pairing-based cryptography, which is one of next-generation public-key cryptography, is based on the difficulty of solving the discrete logarithm problem over finite fields. In this researchwe analyzed the discrete logarithm problem over finite field GF(36n) used for efficient implementation of pairing-based cryptography by large-scale experiments. In 2012 we successfully achieved the top-record of solving the discrete logarithms over finite field GF(3582) of 923 bits using a PC cluster of 252 CPUs in about 153 days, and it enables us to precisely estimate the upper bound of computational ability of expected attackers