Experimental results on Cheon's algorithm

Tetsuya Izu, Masahiko Takenaka, Masaya Yasuda

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)


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 supersingular elliptic curve defined over GF(3127), which is used for efficient pairing computation in practice. About 8 hours and 34 MByte database 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.

Original languageEnglish
Title of host publicationARES 2010 - 5th International Conference on Availability, Reliability, and Security
Number of pages4
Publication statusPublished - 2010
Externally publishedYes
Event5th International Conference on Availability, Reliability, and Security, ARES 2010 - Krakow, Poland
Duration: Feb 15 2010Feb 18 2010


Other5th International Conference on Availability, Reliability, and Security, ARES 2010

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Safety, Risk, Reliability and Quality


Dive into the research topics of 'Experimental results on Cheon's algorithm'. Together they form a unique fingerprint.

Cite this