Pages that link to "Item:Q1009125"

The following pages link to Efficient \(p\)th root computations in finite fields of characteristic \(p\) (Q1009125):

Displaying 11 items.

• Swan-like results for binomials and trinomials over finite fields of odd characteristic (Q648071) (← links)
• A generalization of the Hansen-Mullen conjecture on irreducible polynomials over finite fields (Q765803) (← links)
• Fast multivariate multi-point evaluation revisited (Q2283121) (← links)
• New cube root algorithm based on the third order linear recurrence relations in finite fields (Q2345923) (← links)
• On the arithmetic operations over finite fields of characteristic three with low complexity (Q2349632) (← links)
• Formulas for cube roots in \(\mathbb F_{3^m}\) using shifted polynomial basis (Q2446580) (← links)
• Efficient computation of roots in finite fields (Q2491305) (← links)
• Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields (Q5301629) (← links)
• Efficient Primitives from Exponentiation in ℤ p (Q5757721) (← links)
• (Q6039849) (← links)
• Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities (Q6631548) (← links)