Finding a square root of -1 mod p
Read OriginalThis technical article details the mathematical condition (p ≡ 1 mod 4) for the existence of a square root of -1 modulo an odd prime p. It explains the algorithm to find such a root using a quadratic non-residue c and provides a concrete Python implementation for the large prime p = 2²⁵⁵ - 19.
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
Quoting Thariq Shihipar
Simon Willison
•
2 votes
2
Container queries are rad AF!
Chris Ferdinandi
•
1 votes
3
Top picks — 2026 January
Paweł Grzybek
•
1 votes
4
In Praise of –dry-run
Henrik Warne
•
1 votes
5
Deep Learning is Powerful Because It Makes Hard Things Easy - Reflections 10 Years On
Ferenc Huszár
•
1 votes
6
Vibe coding your first iOS app
William Denniss
•
1 votes
7
AGI, ASI, A*I – Do we have all we need to get there?
John D. Cook
•
1 votes