RSA Algorithm Tutorial Part 1 Generating Keys

This is the RSA Algorithm Tutorial Part 1 - Generating Keys. This will demonstrate how to generate the Public and Private Keys. [ e, N ] and [ d, N ] This gives the mathematical proof and minor history of Public and Private Keys. References: Professor Don Patterson https://youtu.be/U5sCY-B1hXk Software Engineer Vancouver, Canada http://doctrina.org/How-RSA-Works-With-Examples.html History https://www.sccs.swarthmore.edu/users/10/mkelly1/rsa.pdf Mod Checker https://www.omnicalculator.com/math/modulo#what-are-modulo-operations GCD Calc https://www.mathportal.org/calculators/numbers-calculators/gcd-lcm-calculator.php The Extended Euclidean Algorithm https://planetcalc.com/3298/ https://www.youtube.com/watch?v=kYasb426Yjk