Engineering↗
Square Roots Modulo a Prime: the Shanks-Tonelli Algorithm
Extracting square roots modulo a prime: the easy congruence classes, the general Shanks-Tonelli algorithm, and lifting to prime powers.
Every page in the KEVOS library tagged Modular Square Root. 2 pages.
Extracting square roots modulo a prime: the easy congruence classes, the general Shanks-Tonelli algorithm, and lifting to prime powers.
Computing modular square roots: the p ≡ 3 (mod 4) shortcut, the Tonelli–Shanks algorithm and its 2-adic structure, and Cornacchia's algorithm for x² + dy² = p.