Experimental Results on Cheon´s Algorithm

The discrete logarithm problem (DLP) is one of the familiar problem on which cryptographic schemes rely. In 2006, Cheon proposed an algorithm for solving DLP with auxiliary input which works better than conventional algorithms. This paper firstly reports experimental results on Cheon´s algorithm for DLP on a super singular elliptic curve defined over GF(3¹²⁷), which is used for efficient pairing computation in practice. About 8 hours and 34 MByte data-base are required for the 1st step of Cheon´s algorithm, and about 6 hours and 23 MByte data-base for the 2nd step. In total, about 14 hours are required for solving the problem. Our results imply that the security evaluation from a viewpoint of Cheon´s algorithm is crucial.