Title :
A note on square roots in finite fields
Author_Institution :
Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA
fDate :
11/1/1990 12:00:00 AM
Abstract :
A simple method showing the quadratic character in a finite field of odd order q can be computed in O(log2 q) steps is presented. It is also shown how sequences generated deterministically from a random seed can be used reliably in a recent randomized algorithm of R. Peralta (1986) for computing square roots in finite fields
Keywords :
mathematics computing; finite fields; quadratic character; randomized algorithm; square roots; Apertures; Autocorrelation; Binary sequences; Counting circuits; Electron optics; Equations; Galois fields; Information theory; Optical imaging; Personal communication networks;
Journal_Title :
Information Theory, IEEE Transactions on
