Improving the pocklington and padr Ó-s Áez cube root algorithm

Gook Hwa Cho, Hyang Sook Lee

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper, we present a cube root algorithm using a recurrence relation. Additionally, we compare the implementations of the Pocklington and Padró-Sáez algorithm with the Adleman-Manders-Miller algorithm. With the recurrence relations, we improve the Pocklington and Padró-Sáez algorithm by using a smaller base for exponentiation. Our method can reduce the average number of Fq multiplications.

Original languageEnglish
Pages (from-to)277-283
Number of pages7
JournalBulletin of the Korean Mathematical Society
Volume56
Issue number2
DOIs
StatePublished - 2019

Bibliographical note

Funding Information:
Acknowledgements. This research was supported by Basic Science Research Program through the National Research Foundation of Korea(NRF) funded by the Ministry of Education (2009-0093827). The work of G. H. Cho was supported by Basic Science Research Program through the National Research Foundation of Korea(NRF) funded by the Ministry of Education (2018R1D1A1B07041716).

Publisher Copyright:
© 2019 Korean Mathematical Society.

Keywords

  • Adleman-Manders-Miller algorithm
  • Cipolla-Lehmer algorithm
  • Cube root algorithm
  • Finite field
  • Pocklington algorithm

Fingerprint

Dive into the research topics of 'Improving the pocklington and padr Ó-s Áez cube root algorithm'. Together they form a unique fingerprint.

Cite this