Abstract
A simple method showing the quadratic character in a finite field of odd order q can be computed in O(log/sup 2/ 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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
