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 proceedingConference 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 languageEnglish
Title of host publicationProceedings - 2011 5th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2011
Pages594-596
Number of pages3
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event2011 5th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2011 - Seoul, Korea, Republic of
Duration: Jun 30 2011Jul 2 2011

Other

Other2011 5th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, IMIS 2011
CountryKorea, Republic of
CitySeoul
Period6/30/117/2/11

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Computer Science Applications

Cite this