@@alwaysinagoodshape5327 Good grief, what a bunch of snowflakes here. My point was that my formal expensive education didn't have explain this as eloquently as this short, free RU-vid video does.
@@shamsmehdi3725 I have no idea what "making a numbnut followers idiot" means, but all that matters is that he taught these high school kids a topic, and he taught it in a way which allows anyone to understand it easily.
If the two hours of high-level maths did not reveal the intricacies of RSA but you think 9 minutes of an over-simplified example does, you belong to neither Computer Science nor Mathematics.
This makes more sense than some other videos that i searched for in other places with the fictional alice and bob. Proper detail like in this video with the actual numbers is far better than other videos i've seen elsewhere
Being from Ireland, the first couple of times I heard you say "Irish say" I had to remind myself he's saying "RSA", ha ha. Great lecture, brilliant enthusiasm and clear explanation, thank you! You're not just a good lecturer, you're clearly also a fantastic teacher.
Some remarks: 1. The public key is (k = 5, m = 14), where 14 is a modulus (often large) chosen by the recipient, and 5 is an unit mod φ(14). Note that 5 is multiplicatively invertible under mod φ(14), and the inverse of 5 is 5 mod φ(14). 2. φ is the Euler totient function. φ(14) is the counting of positive number that is less than 14 and is relative prime to 14. φ(14) = 6 = (2 - 1)*(7 - 1). 3. The private key is the inverse of k = 5 mod φ(14), i.e. 5 mod φ(14). 4. In the video, we use 11 as our private key since 11 is congruent to 5 mod φ(14). We could use any number that is congruent to 5 mod φ(14), i.e. 5, 11, 17, 23, ... etc.
I love how you simplify the algorithm & solution. Additionally, that was a great homework assignment to show why we can't rely on approximations stored in calculators for irrational numbers.
Watching this preping for a Master's degree - so well explained, actually got some insights from this that were not in the University lectures. For a while I was thinking something was wrong, but this actually highlight things in my notes I had failed to appreciate. Good job!
Every time I don't understand things in my classes in computer science, I get on youtube to find an explanation video about the topic I want to understand. And almost every time I find a video of yours. I like the way you teach and you make it very easy to understand complex things. Keep your work going man, you're great!
The simpler way to do this would be To find 4194304 (mod 14): 4194304 / 14 = 299593.1429... 14 X 299593 = 4194302 (discard decimals) 4194304 - 4194302 = 2
Dude THANK YOU! I had a RSA algorithm problem due at midnight and I would have not been able to solve it without your guidance. Thank you for everything you do to make students lives a little easier.
Hi Eddie, I know this video is a few years old but thank you so much. I've struggled a lot with this from watching other videos and reading about it online. This video made it so easy to understand, thank you!
Australia Year 12 Graduate here. For our last part of Digital Solutions, we dove into ciphers, consisting of the basics of caesars cipher, vigenere cipher, OTP ciphers, and eventually RSA encryptions. My issue wasn't the way it works, but more of how to implement it into code. This video helped me develop a C file that could take in a p,q and a string to output an encrypted message, as well as allowing me to decrypt it. Thank you soo much for the headaches you saved me from.
6:40 it would be easier if you divide 4194304 by 14 which equals to 299593.14... then we take the integer part (299593) and multiply by 14 which is equal to 4194302.. and now if we subtract 4194302 from 4194304 and we get 2 which is equal to number B
haha exactly what i was thinking when he was doing the video. The reason he got the 1.999 is because when he did the division he got a repeating decimal and you cant really multiply a repeating decimal the calculators got to chop the number off somewhere.
Eddie, I just wanted to say THANK YOU! This video taught me more in 8 minutes than I was able to figure out in 2 hours trying to decipher (hah) my textbook. Stay awesome. :)
There are many videos out there that explain the concept of public and private key in a simple way, but I always thought they were too "abstract". In my opinion, this here is a really good explanation that makes you grasp the concept in a better way, because it "dives the right amount of deep" for a initial explanation.
Man, this brought back memories when, for reasons unknown, YT put this in my feed. Made me remember the demo program with a silly little Windows Forms interface (hey this was over a decade ago) I wrote during my Master's at Monash and have a look at the old source code. Had to do it with "classical" random primes and then also with elliptic curves - and included Diffie Hellman for key exchange. It showed all the various steps including the "magic" going on in the background. Was one of my favourite units (and got me a HD ;). How I wish I'd had teachers like you so we would have done this in high school!
woo woo you are awesome . now im in second term of university and im studying Software engineering but wish i has teachers like you in school . your explanation is great and I really appreciate you . i wish you luck .
I really cant describe in words how f***** AWESOME you are man. Ive been watching your videos since year 10 and now im in college, watching this video to clear some concepts in Quantum Computing. Thanks Eddi
I know it's just a demonstration but working out both (4**11)%14 and (4**5)%14 are 2 (or the original B), so you can "decipher" with either. And there are several other ways to reach the same answer, but also a pattern actually emerges (mod remainder 2, 8, 4, repeat). But I imagine that the actual math behind the algorithm is much more complicated. Thanks, cool video.
Wish I had a teacher like you man holy shit. I was confused till I found you. GGs only wasted 1 day trying to figure this out and boom in 8 mins im a God at RSA crypto.
it sucks to watch a great professor that is talented and knows how to educate be disrespected by his students like this. I learned so much this and I appreciate all your diligent work !
The "lock" analogy is much better than the "public key" terminology. I came up with this idea soon after I learned the RSA and I am not alone. I wonder why they have not changed the terminology yet?!
I went through this video pair on RSA at least twice during my Uni days. Now watching more recreationally. Only today do I notice that there's a Yoga poster on the wall. Guess when doing Uni assignments, you are really focused on the content :D
