A fast square root computation using the Frobenius mapping

Wang Feng, Yasuyuki Nogami, Yoshitaka Morikawa

Research output: Contribution to journalArticle

4 Citations (Scopus)


The objective of this paper is to give a fast square root computation method. First the Frobenius mapping is adopted. Then a lot of calculations over an extension field are reduced to that over a proper subfield by the norm computation. In addition a inverse square root algorithm and an addition chain are adopted to save the computation cost. All of the above-mentioned steps have been proven to make the proposed algorithm much faster than the conventional algorithm. From the table which compares the computation between the conventional and the proposed algorithm, it is clearly shown that the proposed algorithm accelerates the square root computation 10 times and 20 times faster than the conventional algorithm in Fp11 and Fp22 respectively. At the same time, the proposed algorithm reduces the computation cost 10 times and 20 times less than the conventional algorithm.

Original languageEnglish
Pages (from-to)1-10
Number of pages10
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publication statusPublished - 2003


ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science
  • Engineering(all)

Cite this