Finding Mod-p Square Roots with the Tonelli-Shanks Algorithm
In this video we review the theory of quadratic residues of an odd prime and then implement the Tonelli-Shanks algorithm in Python to find a square root. We end the video by showing how we can use this algorithm to find points with given x-values on real world elliptic curves. Code: https://github.com/jacksoninfosec/ton...
▶︎
Square roots mod p -- Number Theory 25
▶︎
How can Computers Calculate Sine, Cosine, and More? | Introduction to the CORDIC Algorithm #SoME3
▶︎
Dijkstra's Hidden Prime Finding Algorithm
▶︎
The Strange Math That Predicts (Almost) Anything
▶︎
The Two Envelope Problem - a Mystifying Probability Paradox
▶︎
The most beautiful formula not enough people understand
▶︎
The Greatest Unsolved Problem In Mathematics
▶︎
Math 110: 2/23 Computing square roots mod p (Tonelli's algorithm)
▶︎
How a Russian student invented a faster multiplication method
▶︎
Information Theory Basics
▶︎
Group theory, abstraction, and the 196,883-dimensional monster
▶︎
Ramanujan's favorite coincidence (it's not a coincidence)
▶︎
The Story of Information Theory: from Morse to Shannon to ENTROPY
▶︎
Chinese Remainder Theorem and Cards - Numberphile
▶︎
Creator of C++: Bell Labs, Negative Overhead Abstraction, Mistakes | Bjarne Stroustrup
▶︎
Where my explanation of Grover’s algorithm failed
▶︎
Fermat’s HUGE little theorem, pseudoprimes and Futurama
▶︎
William Dunham, A tribute to Euler
▶︎
The rarest move in chess
▶︎