Generalized cipolla-lehmer root computation in finite fields

Zhe Li, Xiaolei Dong*, Zhenfu Cao

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

We consider the computation of r-th roots in finite fields. For the computation of square roots, there are two typical probabilistic methods: The Tonelli-Shanks method and the Cipolla-Lehmer method. The former method can be extended to the case of r-th roots, which is called the Adleman-Manders- Miller(AMM) method. The latter method had been generalized to the case of r-th roots with r prime. In this paper, we extend the Cipolla-Lehmer to the case of r-th root with r prime power and give the expected running time of our algorithm.

Original languageEnglish
Title of host publicationIET Conference Publications
PublisherInstitution of Engineering and Technology
EditionCP657
ISBN (Print)9781849199094
DOIs
StatePublished - 2014
Event2014 International Conference on Information and Network Security, ICINS 2014 - Beijing, China
Duration: 14 Nov 201416 Nov 2014

Publication series

NameIET Conference Publications
NumberCP657
Volume2014

Conference

Conference2014 International Conference on Information and Network Security, ICINS 2014
Country/TerritoryChina
CityBeijing
Period14/11/1416/11/14

Keywords

  • Finite field
  • Root computation
  • The cipolla-lehmer method

Fingerprint

Dive into the research topics of 'Generalized cipolla-lehmer root computation in finite fields'. Together they form a unique fingerprint.

Cite this