A Complete Generalization of Atkin's Square Root Algorithm

DOI10.3233/FI-2013-853zbMath1305.11113OpenAlexW2156593301MaRDI QIDQ2843816

Armand Stefan Rotaru, Sorin Iftene

Publication date: 26 August 2013

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2013-853

zbMATH Keywords

complexityfinite fieldsefficient computationsquare roots

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Related Items (2)

On the Cipolla-Lehmer type algorithms in finite fields ⋮ Computing square roots faster than the Tonelli-Shanks/Bernstein algorithm

This page was built for publication: A Complete Generalization of Atkin's Square Root Algorithm