@thabg007
my brain is running at 100% CPU usage watching this video
@pixelbogpixxelbog2090
10 years old? Wow better quality than most videos today. Well done :)
@ashokbanerjee8843
Admirable how simply you worked through explaining it all. Beautifully done, both the delivery and the accompanying graphics and animation
@fries6402
remember watching these on khan academy when i was in elementary school and am now taking cryptography as an upper level math class in university. these videos were ahead of their time and the explanation is still at a gold standard
@TheSleyths
God the people that came up with this thing are surely geniuses, can't but feel idiotic after watching this.
@arrelite
should be some law stating that any and all education must be presented in a manner equal to or greater than the quality of this video.
@whatever-ko8qx
I might be late to the party but thanks a bunch for this awesome explanation! These 17 minutes were more effective than 2 hours of lecture at my university.
@SawSkooh
Outstanding explanation with one frustrating defect: throwing 'k' in with absolutely no mention of how to obtain it. Getting the right k is essential for calculating d.
@davidr.flores2043
This is the 'n' time I've come back for this explanation, and every time I watch it I am nothing short of amazed. Kudos to Art of the Problem!!!
@MaxRoth
I saw a few people asked about where the k=2 comes from around 14:22. I spent a while trying to figure this out myself so I thought I would share. Rather than guess a k, the better way to solve for d is to find the modular inverse d= e^-1 mod phi(n). I found a python script that could do this quickly and allowed me to solve for d easily. It also allows you to make sure that the gcd of e and phi n are is one. That is necessary. https://en.wikipedia.org/wiki/Multiplicative_modular_inverse Oh and I also should say that is an awesome video and I am very grateful that you took the time to make this. It really is an amazing piece of work. Thanks!
@cottondai
Wow what a great way to convey such a difficult subject of cryptography in such a comprehensive yet understandable way.
@matthewsnow6317
This is by far the best explanation of RSA Encryption I've ever seen. I really like how you actually explained the algorithms and how it was derived.
@skim2958
This video is by far the most elegant and easy to understand explanation of RSA encryption I've seen. Thank you.
@robineff708
This was just what I was looking for, and very good up until 12:00. Then I had to watch it a couple times, and fill in a couple intermediate math steps that were glossed over, but now I got it. It also helps to know the rules for picking d and e, which are better covered in other videos (explains why k is there and why he could magically replace it with 2, for instance).
@theeggmancometh
This is probably the best explanation I've seen yet as to how this works - it's always boggled my mind when I start thinking about numbers that large, and I'm no slouch at math.
@Vojtos3
This is gold. I can’t image how much work it must have involved. I appreciate your work greatly
@yangpiao3071
The best video about explaining the RSA. Not only the procedure of performing encryption and decryption, but also clarify mathmathic knowledge behind that.
@jatinsw1128
One of the finest videos to explain the beauty of cryptology and hence prove the magic of prime numbers
@davidr.flores2043
I'd like to take the opportunity to thank those who kindly put the time and effort to do this MAGNIFICENT video. EVERYTHING is extremely well thought, done and said. Kudos to you "Art of the Problem". Cheers
@karjedav