A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.)
From MaRDI portal
Publication:3806810
DOI10.1109/TIT.1986.1057236zbMath0658.68043MaRDI QIDQ3806810
Publication date: 1986
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
finite fields; square roots; computational number theory; random polynomial time algorithm; RP algorithms
68Q25: Analysis of algorithms and problem complexity
68W30: Symbolic computation and algebraic computation
11T99: Finite fields and commutative rings (number-theoretic aspects)
11A15: Power residues, reciprocity
12-04: Software, source code, etc. for problems pertaining to field theory
Related Items
An algorithm for recognising the exterior square of a matrix, Improved authenticated multiple-key agreement protocol, On splitting sets in block designs and finding roots of polynomials, Univariate polynomial factorization over finite fields, Efficient randomized generation of optimal algorithms for multiplication in certain finite fields, An algorithm to compute the number of points on elliptic curves of \(j\)-invariant 0 or 1728 over a finite field, Improved low-computation partially blind signatures., Taking cube roots in \(\mathbb Z_{m}\), On the complexity of the discrete logarithm and Diffie-Hellman problems
