Pages that link to "Item:Q2843816"
From MaRDI portal
The following pages link to A complete generalization of Atkin's square root algorithm (Q2843816):
Displaying 5 items.
- Improved generalized Atkin algorithm for computing square roots in finite fields (Q844143) (← links)
- On the Cipolla-Lehmer type algorithms in finite fields (Q2631927) (← links)
- On Shanks' Algorithm for Modular Square Roots (Q4670089) (← links)
- Computing square roots faster than the Tonelli-Shanks/Bernstein algorithm (Q6089458) (← links)
- On the computation of \(r\)-th roots in finite fields (Q6615544) (← links)