Finding a non-square mod p
Read OriginalThe article details Stan Wagon's algorithm for expressing a prime p ≡ 1 mod 4 as a sum of two squares, focusing on the first step: finding a quadratic non-residue (non-square) modulo p. It provides Python code using the Legendre symbol, discusses testing strategies using consecutive primes versus random candidates, and illustrates the process with large primes from cryptographic standards like Curve25519 and NIST P-384.
Comments
No comments yet
Be the first to share your thoughts!
Browser Extension
Get instant access to AllDevBlogs from your browser
Top of the Week
1
The Beautiful Web
Jens Oliver Meiert
•
2 votes
2
When your coding agent doesn’t understand your project, you’ll get junk
Benjamin Cane
•
1 votes
3
LLM Use in the Python Source Code
Miguel Grinberg
•
1 votes
4
Wagon’s algorithm in Python
John D. Cook
•
1 votes
5
An example conversation with Claude Code
Dumm Zeuch
•
1 votes