Finding Mod-p Square Roots with the Tonelli-Shanks Algorithm Published 2020-10-28 Download video MP4 360p Download video MP4 720p Recommendations 17:35 Square & Multiply Algorithm - Computerphile 20:14 Square Roots Modulo P — Number Theory 25 11:56 solving a quadratic congruence but the modulus is NOT prime 20:08 Fast Inverse Square Root — A Quake III Algorithm 23:51 Why is this number everywhere? 15:41 Adding Nested Loops Makes this Algorithm 120x FASTER? 19:12 2023's Biggest Breakthroughs in Math 13:31 This Algorithm is 1,606,240% FASTER 23:30 Elliptic Curve Cryptography - Part 3 - Multiples of a Base Point 20:14 Square roots mod p -- Number Theory 25 1:33:29 SciPy Tutorial (2022): For Physicists, Engineers, and Mathematicians 29:07 Theory of numbers: Quadratic residues 11:49 07 square roots mod n 05:25 STOP Learning These Programming Languages (for Beginners) 12:39 Premature Optimization 14:58 The Scientist Who Discovered the World's Most Beautiful Equation 11:34 Elastic knots are really mind bending 19:25 Branchless Programming: Why "If" is Sloowww... and what we can do about it! 15:06 Prime Numbers & RSA Encryption Algorithm - Computerphile 05:09 computers suck at division (a painful discovery) Similar videos 40:21 Math 110: 2/23 Computing square roots mod p (Tonelli's algorithm) 10:55 Number Theory | When is there a square root of 2 modulo p? 04:44 Number Theory | Quadratic Residues: Definition and Examples 13:46 Quadratic Residues - Finding Square Roots (mod p) - Part 11 04:11 Code Review: Tonelli-Shanks algorithm implementation of prime modular square root (3 Solutions!!) 05:29 Is 16 an eighth power modulo a prime p? — The Ross Program 28:26 RSA VI - Square roots mod n and Dixon's method of random squares 14:25 Quadratic Residues - Square root (mod n) - Part 19 08:19 The Discrete Logarithm Problem 09:50 BSGS Example Part 1 21:41 Introduction to number theory lecture 25. Quadratic equations mod p. 12:11 MAT1033 11.1 Part 1 (Square Root Property) Module Lecture 04:49 ROOTS OF NUMBERS - ALGORITHM (STEP-BY-STEP TUTORIAL) 10:01 Square Roots mod prime p=4m+1 (part 1) 21:22 MATA02 - Lecture 10d - Roots in modular arithmetic using Euler's Theorem 17:09 10 3 Modular e 'th roots 17 min 05:49 Number Theory | Solutions of x^d-1 =0 mod p. More results