Computing square roots faster than the Tonelli-Shanks/Bernstein algorithm

DOI10.3934/amc.2022007zbMath1529.11130OpenAlexW3107561082MaRDI QIDQ6089458

Palash Sarkar

Publication date: 14 December 2023

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2022007

zbMATH Keywords

square roottable look-upTonelli-Shanks algorithm

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16)

Cites Work

• Improved generalized Atkin algorithm for computing square roots in finite fields
• On the computation of square roots in finite fields
• A Complete Generalization of Atkin's Square Root Algorithm
• Adleman-Manders-Miller Root Extraction Method Revisited
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing square roots faster than the Tonelli-Shanks/Bernstein algorithm