A note on square roots in finite fields
From MaRDI portal
Publication:5749383
DOI10.1109/18.59955zbMath0718.11066OpenAlexW2129886174MaRDI QIDQ5749383
Publication date: 1990
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: http://digital.library.wisc.edu/1793/11028
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Algebraic number theory computations (11Y40)
Related Items (8)
Improved generalized Atkin algorithm for computing square roots in finite fields ⋮ Univariate polynomial factorization over finite fields ⋮ Fast algorithms for solving equations of degree \(\le 4\) in some finite fields ⋮ Fast algorithm of square rooting in some finite fields of odd characteristic ⋮ On taking square roots without quadratic nonresidues over finite fields ⋮ Efficient randomized generation of optimal algorithms for multiplication in certain finite fields ⋮ An O(M(n) logn) Algorithm for the Jacobi Symbol ⋮ An algorithm to compute the number of points on elliptic curves of \(j\)-invariant 0 or 1728 over a finite field
This page was built for publication: A note on square roots in finite fields
