Time estimation of Cheon's algorithm over elliptic curves on finite fields with characteristic 3

Tetsuya Izu; Masahiko Takenaka; Masaya Yasuda

doi:10.1109/IMIS.2011.113

Time estimation of Cheon's algorithm over elliptic curves on finite fields with characteristic 3

Tetsuya Izu, Masahiko Takenaka, Masaya Yasuda

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

Abstract

Cheon introduced a novel algorithm for solving the discrete logarithm problems with auxiliary input (DLPwAI). Since the infeasibility of DLPwAI assures the security of some cryptographic schemes, some implementational results have been reported. This paper estimates the required time for solving DLPwAI on elliptic curves over finite fields with characteristics 3 by extrapolating previous results.

Original language	English
Title of host publication	Proceedings - 2011 5th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2011
Pages	594-596
Number of pages	3
DOIs	https://doi.org/10.1109/IMIS.2011.113
Publication status	Published - 2011
Externally published	Yes
Event	2011 5th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2011 - Seoul, Korea, Republic of Duration: Jun 30 2011 → Jul 2 2011

Other

Other	2011 5th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2011
Country/Territory	Korea, Republic of
City	Seoul
Period	6/30/11 → 7/2/11

All Science Journal Classification (ASJC) codes

Computer Networks and Communications
Computer Science Applications

Access to Document

10.1109/IMIS.2011.113

Cite this

Time estimation of Cheon's algorithm over elliptic curves on finite fields with characteristic 3. / Izu, Tetsuya; Takenaka, Masahiko; Yasuda, Masaya.
Proceedings - 2011 5th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2011. 2011. p. 594-596 5976280.

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

Izu, T, Takenaka, M & Yasuda, M 2011, Time estimation of Cheon's algorithm over elliptic curves on finite fields with characteristic 3. in Proceedings - 2011 5th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2011., 5976280, pp. 594-596, 2011 5th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2011, Seoul, Korea, Republic of, 6/30/11. https://doi.org/10.1109/IMIS.2011.113

@inproceedings{37ec1c2b7dde4af7b0fe4c1c9a4933cb,

title = "Time estimation of Cheon's algorithm over elliptic curves on finite fields with characteristic 3",

abstract = "Cheon introduced a novel algorithm for solving the discrete logarithm problems with auxiliary input (DLPwAI). Since the infeasibility of DLPwAI assures the security of some cryptographic schemes, some implementational results have been reported. This paper estimates the required time for solving DLPwAI on elliptic curves over finite fields with characteristics 3 by extrapolating previous results.",

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

year = "2011",

doi = "10.1109/IMIS.2011.113",

language = "English",

isbn = "9780769543727",

pages = "594--596",

booktitle = "Proceedings - 2011 5th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2011",

note = "2011 5th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2011 ; Conference date: 30-06-2011 Through 02-07-2011",

}

TY - GEN

T1 - Time estimation of Cheon's algorithm over elliptic curves on finite fields with characteristic 3

AU - Izu, Tetsuya

AU - Takenaka, Masahiko

AU - Yasuda, Masaya

PY - 2011

Y1 - 2011

N2 - Cheon introduced a novel algorithm for solving the discrete logarithm problems with auxiliary input (DLPwAI). Since the infeasibility of DLPwAI assures the security of some cryptographic schemes, some implementational results have been reported. This paper estimates the required time for solving DLPwAI on elliptic curves over finite fields with characteristics 3 by extrapolating previous results.

AB - Cheon introduced a novel algorithm for solving the discrete logarithm problems with auxiliary input (DLPwAI). Since the infeasibility of DLPwAI assures the security of some cryptographic schemes, some implementational results have been reported. This paper estimates the required time for solving DLPwAI on elliptic curves over finite fields with characteristics 3 by extrapolating previous results.

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

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

U2 - 10.1109/IMIS.2011.113

DO - 10.1109/IMIS.2011.113

M3 - Conference contribution

AN - SCOPUS:80052390237

SN - 9780769543727

SP - 594

EP - 596

BT - Proceedings - 2011 5th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2011

T2 - 2011 5th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2011

Y2 - 30 June 2011 through 2 July 2011

ER -

Time estimation of Cheon's algorithm over elliptic curves on finite fields with characteristic 3

Abstract

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this