A Study on the Parameter Size of the Montgomery Trick for ECDLP

Ken Ikuta, Sho Joichi, Kazuya Kobayashi, Md Al Amin Khandaker, Takuya Kusaka, Yasuyuki Nogami

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

Abstract

In this research, the choice of the parameter of the Montgomery trick in Pollard's Rho method to solve the elliptic curve discrete logarithm problem for Barreto-Naehrig (BN) curves is shown. The average number of generated rational points per unit time is chosen as a measure of the effectiveness of the choice of the parameter of the Montgomery trick. The results are derived from a sufficient number of experiments with several BN curves.

Original languageEnglish
Title of host publicationProceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages623-627
Number of pages5
ISBN (Electronic)9784885523182
DOIs
Publication statusPublished - Mar 8 2019
Event15th International Symposium on Information Theory and Its Applications, ISITA 2018 - Singapore, Singapore
Duration: Oct 28 2018Oct 31 2018

Publication series

NameProceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018

Conference

Conference15th International Symposium on Information Theory and Its Applications, ISITA 2018
CountrySingapore
CitySingapore
Period10/28/1810/31/18

    Fingerprint

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Cite this

Ikuta, K., Joichi, S., Kobayashi, K., Khandaker, M. A. A., Kusaka, T., & Nogami, Y. (2019). A Study on the Parameter Size of the Montgomery Trick for ECDLP. In Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018 (pp. 623-627). [8664242] (Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.23919/ISITA.2018.8664242