Pages that link to "Item:Q2862538"
From MaRDI portal
The following pages link to Taking roots over high extensions of finite fields (Q2862538):
Displaying 15 items.
- Effective black-box constructive recognition of classical groups. (Q468719) (← links)
- Modular composition via factorization (Q722764) (← links)
- Efficient \(p\)th root computations in finite fields of characteristic \(p\) (Q1009125) (← links)
- Taking \(p\)th roots modulo polynomials over finite fields (Q1395768) (← links)
- An efficient algorithm for deciding quadratic residuosity in finite fields \(GF(p^ m)\) (Q1822956) (← links)
- Computing in degree \(2^k\)-extensions of finite fields of odd characteristic (Q2260788) (← links)
- Efficient computation of roots in finite fields (Q2491305) (← links)
- On the Cipolla-Lehmer type algorithms in finite fields (Q2631927) (← links)
- Fast algorithms for solving equations of degree \(\le 4\) in some finite fields (Q2666933) (← links)
- Randomized root finding over finite FFT-fields using tangent Graeffe transforms (Q2819758) (← links)
- Subgroup Refinement Algorithms for Root Finding in $GF(q)$ (Q3990651) (← links)
- Computing isomorphisms and embeddings of finite fields (Q4612574) (← links)
- Trace expression of \(r\)-th root over finite field (Q5118842) (← links)
- Multiradical isogenies (Q5880203) (← links)
- On the computation of \(r\)-th roots in finite fields (Q6615544) (← links)
