A complete generalization of Atkin's square root algorithm

DOI10.3233/FI-2013-853MaRDI QIDQ2843816zbMATH OpenOpenAlexFDO

Authors 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

complexityefficient computationfinite fieldssquare roots

Mathematics Subject Classification ID

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

Recommendations

• Improved generalized Atkin algorithm for computing square roots in finite fields
• On the computation of square roots in finite fields
• scientific article; zbMATH DE number 2086246
• A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.)
• On Shanks' Algorithm for Modular Square Roots

Cited in

(6)

• On the Cipolla-Lehmer type algorithms in finite fields
• scientific article; zbMATH DE number 2086246 (Why is no real title available?)
• On Shanks' Algorithm for Modular Square Roots
• Computing square roots faster than the Tonelli-Shanks/Bernstein algorithm
• On the computation of r-th roots in finite fields
• Improved generalized Atkin algorithm for computing square roots in finite fields

This page was built for publication: A complete generalization of Atkin's square root algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2843816)