Pages that link to "Item:Q2491305"
From MaRDI portal
The following pages link to Efficient computation of roots in finite fields (Q2491305):
Displaying 19 items.
- Deterministic root finding over finite fields using Graeffe transforms (Q300881) (← links)
- An optimal representation for the trace zero subgroup (Q521853) (← links)
- Efficient \(p\)th root computations in finite fields of characteristic \(p\) (Q1009125) (← links)
- Factoring polynomials of the form \(f(x^n) \in \mathbb{F}_q [x]\) (Q1679708) (← links)
- Fast algorithm of square rooting in some finite fields of odd characteristic (Q1725540) (← links)
- On the computation of square roots in finite fields (Q1878298) (← links)
- Multivariate public key cryptosystem from Sidon spaces (Q2061921) (← 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)
- Fast algorithms for solving equations of degree \(\le 4\) in some finite fields (Q2666933) (← links)
- Taking roots over high extensions of finite fields (Q2862538) (← links)
- Fast Computation of the Nth Term of an Algebraic Series over a Finite Prime Field (Q2985816) (← links)
- On taking square roots without quadratic nonresidues over finite fields (Q3015058) (← links)
- Efficient Finite Fields in the Maxima Computer Algebra System (Q3519552) (← links)
- Subgroup Refinement Algorithms for Root Finding in $GF(q)$ (Q3990651) (← links)
- Trace expression of \(r\)-th root over finite field (Q5118842) (← links)
- Fundamentals of Computation Theory (Q5900790) (← links)
- (Q6039849) (← links)
- On the computation of \(r\)-th roots in finite fields (Q6615544) (← links)
