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

DOI10.3934/AMC.2022007zbMATH Open1529.11130OpenAlexW3107561082MaRDI QIDQ6089458FDOQ6089458

Authors: 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

Recommendations

• scientific article; zbMATH DE number 2086246
• On Shanks' Algorithm for Modular Square Roots
• A High-Speed Square Root Algorithm in Extension Fields
• scientific article; zbMATH DE number 1303185
• scientific article; zbMATH DE number 7688194

zbMATH Keywords

square roottable look-upTonelli-Shanks algorithm

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the computation of square roots in finite fields
• Title not available (Why is that?)
• Improved generalized Atkin algorithm for computing square roots in finite fields
• Adleman-Manders-Miller root extraction method revisited
• A complete generalization of Atkin's square root algorithm

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

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