Experimental results on Cheon's algorithm

Tetsuya Izu; Masahiko Takenaka; Masaya Yasuda

doi:10.1109/ARES.2010.55

Experimental results on Cheon's algorithm

Tetsuya Izu, Masahiko Takenaka, Masaya Yasuda

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

8 Citations (Scopus)

Abstract

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(3¹²⁷), 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 language	English
Title of host publication	ARES 2010 - 5th International Conference on Availability, Reliability, and Security
Pages	625-628
Number of pages	4
DOIs	https://doi.org/10.1109/ARES.2010.55
Publication status	Published - 2010
Externally published	Yes
Event	5th International Conference on Availability, Reliability, and Security, ARES 2010 - Krakow, Poland Duration: Feb 15 2010 → Feb 18 2010

Other

Other	5th International Conference on Availability, Reliability, and Security, ARES 2010
Country/Territory	Poland
City	Krakow
Period	2/15/10 → 2/18/10

All Science Journal Classification (ASJC) codes

Computational Theory and Mathematics
Safety, Risk, Reliability and Quality

Access to Document

10.1109/ARES.2010.55

Cite this

@inproceedings{64f44a613d18428a951ad9db8fcb9fb3,

title = "Experimental results on Cheon's algorithm",

abstract = "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.",

author = "Tetsuya Izu and Masahiko Takenaka and Masaya Yasuda",

year = "2010",

doi = "10.1109/ARES.2010.55",

language = "English",

isbn = "9780769539652",

pages = "625--628",

booktitle = "ARES 2010 - 5th International Conference on Availability, Reliability, and Security",

note = "5th International Conference on Availability, Reliability, and Security, ARES 2010 ; Conference date: 15-02-2010 Through 18-02-2010",

}

TY - GEN

T1 - Experimental results on Cheon's algorithm

AU - Izu, Tetsuya

AU - Takenaka, Masahiko

AU - Yasuda, Masaya

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=77952338718&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77952338718&partnerID=8YFLogxK

U2 - 10.1109/ARES.2010.55

DO - 10.1109/ARES.2010.55

M3 - Conference contribution

AN - SCOPUS:77952338718

SN - 9780769539652

SP - 625

EP - 628

BT - ARES 2010 - 5th International Conference on Availability, Reliability, and Security

T2 - 5th International Conference on Availability, Reliability, and Security, ARES 2010

Y2 - 15 February 2010 through 18 February 2010

ER -

Experimental results on Cheon's algorithm

Abstract

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this