Implementation of the Tonelli-Shanks algorithm for computing square roots modulo a prime number.
-
Updated
Oct 9, 2022 - Python
8000
Implementation of the Tonelli-Shanks algorithm for computing square roots modulo a prime number.
Elliptic Curves and other algorithms
Add a description, image, and links to the tonelli-shanks topic page so that developers can more easily learn about it.
To associate your repository with the tonelli-shanks topic, visit your repo's landing page and select "manage topics."