Pages that link to "Item:Q1878298"
From MaRDI portal
The following pages link to On the computation of square roots in finite fields (Q1878298):
Displaying 13 items.
- Improved generalized Atkin algorithm for computing square roots in finite fields (Q844143) (← links)
- Counting points on hyperelliptic curves of type \(y^2=x^{2g+1}+ax^{g+1}+bx\) (Q1994975) (← 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)
- On Fast Calculation of Addition Chains for Isogeny-Based Cryptography (Q2980864) (← links)
- On taking square roots without quadratic nonresidues over finite fields (Q3015058) (← links)
- Efficient Finite Fields in the Maxima Computer Algebra System (Q3519552) (← links)
- (Q5118842) (← links)
- (Q6039849) (← links)
- Computing square roots faster than the Tonelli-Shanks/Bernstein algorithm (Q6089458) (← links)
- Hashing to elliptic curves through Cipolla-Lehmer-Müller's square root algorithm (Q6192060) (← links)
- On the computation of \(r\)-th roots in finite fields (Q6615544) (← links)
