Pages that link to "Item:Q5749383"
From MaRDI portal
The following pages link to A note on square roots in finite fields (Q5749383):
Displaying 17 items.
- Improved generalized Atkin algorithm for computing square roots in finite fields (Q844143) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- Efficient randomized generation of optimal algorithms for multiplication in certain finite fields (Q1198957) (← links)
- An algorithm to compute the number of points on elliptic curves of \(j\)-invariant 0 or 1728 over a finite field (Q1313211) (← links)
- On Hadamard square roots of unity (Q1566743) (← links)
- Fast algorithm of square rooting in some finite fields of odd characteristic (Q1725540) (← links)
- An efficient algorithm for deciding quadratic residuosity in finite fields \(GF(p^ m)\) (Q1822956) (← links)
- On the computation of square roots in finite fields (Q1878298) (← links)
- On the squares in the set of elements of a finite field with constraints on the coefficients of its basis expansion (Q2396417) (← 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)
- On taking square roots without quadratic nonresidues over finite fields (Q3015058) (← links)
- On Repeated Squarings in Binary Fields (Q3651267) (← links)
- Computing Jacobi Symbols modulo Sparse Integers and Polynomials and Some Applications (Q4500854) (← links)
- Dirichlet’s proof of the three-square theorem: An algorithmic perspective (Q4561383) (← links)
- An O(M(n) logn) Algorithm for the Jacobi Symbol (Q4931642) (← links)
- (Q6039849) (← links)
