The RSA Encryption Algorithm (2 of 2: Generating the Keys)

[thebillington]

I'm currently revising for my cryptography final year exam, and this video is the best RSA explanation I've found anywhere. Just a shame that some of his class doesn't keep quiet, they don't realise they're listening to a genius!

[thomasappel]

We need more teachers like this...
He's teaching faster, more accurate and more fun and energetic it sometimes doesn't even feel like he is teaching but is telling us a nice story

[Sahil-phbp]

4:10 "I KNOW you think you are talking softly. You are not talking softly" LOL ROASTED

[jhewitt]

You're an exceptionally talented teacher. Thank you

[jihochoi_cs]

I want to go to this secondary school instead of my university. lol

[abdulazizrehan]

I remember studying 3 courses on Cryptography during my Masters in Theoretical Computer Science taught by a renowned research leader in the field, but I haven't seen anyone explain RSA so beautifully!

[Mathiasmaxi]

"Every sixth multiple is a multiple of sixth"


Genius

[antelope]

I've worked in cyber security for 10+ years and Eddie just explained RSA better than I've ever understood it. Love his style of teaching so much, it is so elegant and succinct!

[DuncanInUK]

Starting to think the concepts in my uni lectures are probably actually quite simple, just the delivery is horrible.

[ankurkumardubey]

For people who are wondering what happened at 11:14
The private key d is derived from the following formula:
d = (k*Φ(n) + 1) / e for some integer k

At step 5 instead of doing what Eddie did, I'd suggest for you to use this formula instead which is basically the same thing.
The little trick here is that k has to be such an integer, that k*Φ(n) + 1%e=0
(% stands for the mathematical mod)

So let us try and find k for the above example where Φ(n)=6 and e=5
if k=1, 1*6+1%e = 2
if k=2, 2*6+1%e = 3
if k=3, 3*6+1%e = 4
if k=4, 4*6+1%e = 0
if k=5, 5*6+1%e = 1
if k=6, 6*6+1%e = 2
if k=7, 7*6+1%e = 3
if k=8, 8*6+1%e = 4
if k=9, 9*6+1%e = 0
So k=9 is our answer. Notice that we did not stop at k=4, because that would give us d=5
and the idea here is that d and e cannot be the same.
Hence, for k=9
d = (k*Φ(n) + 1) / e = 11.

[Kearney]

His enthusiasm is extrodinary and his delivery is second to none. A genius in understanding material, and teaching! You've got a bright future!

[peterhober]

Finally. 40 years old and today I just understood exactly how RSA works, how and why the math actually works. Thank you!

[sanvedlop]

I'd trade ten of my current professors to get you to teach me.

[findthekeys]

I'm at the end of my first semester of a cyber security degree and I just can't get over how brilliantly explained this was. There is SO much more to teaching than just dumping knowledge out there - this video should be shown to all university professors as an example of top level teaching. A wonderful teacher you are Eddie.

[casualyoutuber]

Dude you jusy killed it, I learnt RSA in like 20mins which my teacher couldn't fully deliver in a 2 hours lecture.
You are a really brilliant teacher and you explain stuff so well right down at the level of a student 👌👌

[philippegorov]

Man you're brilliant. Make some online courses and world will be better !

[jijsaxton]

Currently learning network security and cryptography as one of my uni subjects. I have to say this video really helped me to understand the RSA algorithm. Brilliant teacher!

[rodmorgan]

I'm 63, worked for over 40 years in data networking, software development and project management in the telecom industry. Thanks to Mr Woo, I now understand the underlying logic of encryption/decryption. You're never to old to learn and Mr Woo is an exceptional teacher. Thank you.

[kinglouiecd]

Whenever I can't figure out a math concept, I look for an Eddie Woo video on it. You are an excellent teacher, sir.

[lololol]

amazing video! shame when there are people in the class not wanting to listen and yet so many people around the world who would kill to be in their place..