Generalized Cipolla-Lehmer Root Computation in Finite Fields
Generalized Cipolla-Lehmer Root Computation in Finite Fields
- Author(s): Zhe Li ; Xiaolei Dong ; Zhenfu Cao
- DOI: 10.1049/cp.2014.1281
For access to this article, please select a purchase option:
Buy conference paper PDF
Buy Knowledge Pack
IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.
ICINS 2014 - 2014 International Conference on Information and Network Security — Recommend this title to your library
Thank you
Your recommendation has been sent to your librarian.
- Author(s): Zhe Li ; Xiaolei Dong ; Zhenfu Cao Source: ICINS 2014 - 2014 International Conference on Information and Network Security, 2014 page ()
- Conference: ICINS 2014 - 2014 International Conference on Information and Network Security
- DOI: 10.1049/cp.2014.1281
- ISBN: 978-1-84919-909-4
- Location: Beijing, China
- Conference date: 14-16 Nov. 2014
- Format: PDF
We consider the computation of r-th roots in finite field-s. 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.
Inspec keywords: probability; algebra
Subjects: Algebra; Algebra; Algebra; Statistics; Other topics in statistics; Algebra, set theory, and graph theory; Probability theory, stochastic processes, and statistics; Other topics in statistics
Related content
content/conferences/10.1049/cp.2014.1281
pub_keyword,iet_inspecKeyword,pub_concept
6
6