A Refinement of H. C. Williams' qth Root Algorithm

DOI10.2307/2152969zbMath0782.11040OpenAlexW4249146613MaRDI QIDQ3137483

Kenneth Hardy, Kenneth S. Williams

Publication date: 7 March 1994

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2152969

zbMATH Keywords

complexitycongruenceH. C. Williams' \(q\)th root algorithm

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Congruences; primitive roots; residue systems (11A07) Power residues, reciprocity (11A15)

Related Items (4)

On the Cipolla-Lehmer type algorithms in finite fields ⋮ Power roots of polynomials over arbitrary fields ⋮ A refinement of Müller's cube root algorithm ⋮ Taking roots over high extensions of finite fields

This page was built for publication: A Refinement of H. C. Williams' qth Root Algorithm