I wish I could double like this video. All these years of trying to understand how RSA works and it is finally clear to me. Professor you have a gift of explaining things. Thanks for making this video.
You have provided an extremely elegant summary of the fundamental idea. It is usually lost in most material: in the sea of computations for some or in that of lemmas and proofs for others. Thank you.
For anyone still wondering, it is actually easy: you have _k Phi(n)+1 (mod Phi(n))_ just remove the +1 for a moment, obviously _k Phi(n) (mod Phi(n)) = 0_ for any integer _k_ adding back the +1 the result is of course 1, giving the equation _ke kd = 1 (mod Phi(n))_
@@GideonTheTeacher agree, so there are a few congruent signs missing plus that the maths you outlined would require the message to be coprime with your p*q=n.
to save time and board space, he did not write "mod n" for some equations. as long as message is not p or q (not likely, as both are big), message will be co-prime with n.
I wish I could double like this video. All these years of trying to understand how RSA works and it is finally clear to me. Professor you have a gift of explaining things. Thanks for making this video.
The a-ha moment when the math suddenly clicks and you appreciate how beautiful it is, is priceless. Thank you for this video!
You have provided an extremely elegant summary of the fundamental idea. It is usually lost in most material: in the sea of computations for some or in that of lemmas and proofs for others. Thank you.
great video! i like how u delve into the concepts of the theory and not on the algorithm of solving 2+2
Adrian -- you got it, the concept stands on its own merit without the mathematical camouflage.
Thank you for these videos, they are so enlightening, you explain very well.
Thanks. Good explanation! Most ppl only explain the algo.
glad you found it useful.
Thanks for this video, you made RSA easier to understand
thanks!
Most videos I saw just showed the algorithm then proved it, I like this one way better since you derived it from first principles. Thank you very much
I understood everything up until 10 minutes. The step at 10:00 was pretty big. Not sure I followed.
For anyone still wondering, it is actually easy:
you have _k Phi(n)+1 (mod Phi(n))_
just remove the +1 for a moment, obviously _k Phi(n) (mod Phi(n)) = 0_ for any integer _k_
adding back the +1 the result is of course 1, giving the equation _ke kd = 1 (mod Phi(n))_
@@Marco-hw7nc thanks
Very good video! Thank you!
Cool Stuff,
Learning about PKI for the Network + Exam, how did I reach here lol
you are a great prof !!
quantum computing: im boutta end this mans whole career
Indeed, but we have a remedy: eprint.iacr.org/2021/1510
Great! Thank you :)
thanks. you're good
Great!
Dude, you have random mod n appearing and disappearing. Love the idea of the video but there are big gaps.
I think you are confusing congurnecr and equal signs.
This seems to miss the point that we need to exchange information about each other's keys ...
We exchange public key, not the private key
@@GideonTheTeacher agree, so there are a few congruent signs missing plus that the maths you outlined would require the message to be coprime with your p*q=n.
to save time and board space, he did not write "mod n" for some equations. as long as message is not p or q (not likely, as both are big), message will be co-prime with n.
I love cryptography