Pages that link to "Item:Q844143"
From MaRDI portal
The following pages link to Improved generalized Atkin algorithm for computing square roots in finite fields (Q844143):
Displaying 6 items.
- Time-varying square roots finding via Zhang dynamics versus gradient dynamics and the former's link and new explanation to Newton-Raphson iteration (Q1675875) (← links)
- New cube root algorithm based on the third order linear recurrence relations in finite fields (Q2345923) (← links)
- On the Cipolla-Lehmer type algorithms in finite fields (Q2631927) (← links)
- Taking roots over high extensions of finite fields (Q2862538) (← links)
- (Q5118842) (← links)
- Computing square roots faster than the Tonelli-Shanks/Bernstein algorithm (Q6089458) (← links)
