Implementation of the Tonelli-Shanks algorithm for computing square roots modulo a prime number.
-
Updated
Oct 9, 2022 - Python
#
tonelli-shanks
Here are 7 public repositories matching this topic...
Elliptic Curves and other algorithms
cryptography crypto elliptic-curves pairing miller euclidean-algorithm elliptic-curve-arithmetic divisor elliptic-curves-cryptography pairing-cryptography elliptic-curve-cryptography tonelli-shanks divisors elliptic-curve-sum elliptic-curve-points
-
Updated
Dec 12, 2019 - Python
Modular square roots in Julia
-
Updated
Sep 9, 2024 - Julia
Find square root of a Qudratic residue element in Zp (p is prime) using Tonelli Shanks Algorithm
extended-euclidean-algorithm square-root chinese-remainder-theorem tonelli-shanks quadratic-residue binary-exponentiation square-root-modulo-prime square-root-modulo-composite
-
Updated
Sep 6, 2023 - Java
The index calculus for the DLP, quadratic reciprocity, and Tonelli-Shanks.
-
Updated
Oct 25, 2022 - Go
dust - A toy crypto library. Completely insecure, totally unsafe, and horribly inefficient.
-
Updated
Feb 20, 2019 - C
Improve this page
Add a description, image, and links to the tonelli-shanks topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the tonelli-shanks topic, visit your repo's landing page and select "manage topics."