1
$\begingroup$

For example, If my prime was congruent to 3 mod 5. Is there a list where I can find for these primes which do not take the form 3 mod 4?

Edit:

Excluding the general tonelli-shanks algorithm

$\endgroup$

closed as too broad by fkraiem, Squeamish Ossifrage, AleksanderRas, kelalaka, forest Jun 8 at 7:41

Please edit the question to limit it to a specific problem with enough detail to identify an adequate answer. Avoid asking multiple distinct questions at once. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.

  • $\begingroup$ And what's wrong with Tonelli-Shanks? $\endgroup$ – poncho Jun 4 at 18:22
  • $\begingroup$ @poncho nothing, was wondering whether there was faster algorithms for obscure primes or a subset of them $\endgroup$ – WeCanBeFriends Jun 4 at 18:22
  • 1
    $\begingroup$ Maybe cr.yp.to/papers.html#sqroot? $\endgroup$ – Squeamish Ossifrage Jun 4 at 18:23

Browse other questions tagged or ask your own question.