@Iba-j7n
I usually never comment on videos but you’re an absolute legend mate, you exactly know how a student thinks and you know exactly what to teach, please upload more videos, i would love to learn coding from you, cheers
@linamoussadek6467
Why doesn't this have more views??? Thank you so much !!
@Moocow2003
Thank you so much for this tutorial! I could not wrap my head around turning the concepts behind encryption into code before this.
@granger1019
Fantastic. That equation for d was what I was struggling with after a geek for geeks article. Thank you.
@rudraprasad3
Bro you have only one video and a great one.
@thegreatpugtato
Holy shit this was actually huge for an assignment, made it so much easier and less stressful
@CloudCoder-c8h
Thank you for this informative and insightful video! This was easy to understand and very helpful.
@greenxdshadow6635
Thank you, saved me about a half hour of textbook reading
@pedropago
this dude just saved my finals, awesome video thank lord i found it
@michaiahf
How does D = 7? I don't understand that part. Is 7 just a random number that you are using as the message to send?
@emmrodriguez
flawlessly explained bro! thank you
@lucinali6617
I love it! I'm looking forward to learn programming with python with your video.
@นายเยิ้มยิ้มเเย้ม
thank you for make this vdo , I educating form this video to prepare myself for upcoming exam.
@SirArghPirate
I don't get it; how does 3^(-1) % 20 equal 7 and not 0.33..
@georgia9337
So helpful and informational !!!
@zachahmad4097
Really nice video....definitely simple and yet makes a lot of sense!
@MuhammadRaza-yd6sg
congrats on 200 subs!
@Its_Me_Butters
Simple AF, come back with more stuff dude!
@Листочек-ч3к
Thank you so much! The best explanation!!!
@amihart9269
The constraints for e is just {2 < e < r; gcd(e, r) = 1}, and it has to follow those constraints so that the encryption is one-to-one rather than many-to-one, where in the latter case it would not be reversible. More recent versions of RSA use the Carmichael's function, in this case λ(n), (which simplifies to lcm(p - 1, q - 1)) in those constraints rather than r (which is just the Eurler's totient function of n). It achieves the same results but has the benefit of faster decryption.