RSA algorithm step by step example

Brilliant video. This was a challenge for me to understand before I found this video - thank you.

How does RSA guards their prime factors wodering :)

This is missing some important steps: (1) How can you come up with a very large prime number, or more specifically, given a very large prime number, how can you guarantee it's prime? (2) How can you come up with good values for E and D in a reasonable amount of computer time? (3) How can computers efficiently do ModPow with super large values?

There are algorithms for all of these, and they are super important. Without them, RSA would be a cool idea, but not usable in the real world. Without explaining these algorithms along side what was presented, you're only giving part of the story.

Once you understand Bitcoin, you can’t go back

I’m in it for the long haul. Bitcoin forever! 🌐

If I had some magical device that found the other prime number of RSA-2048, I wouldn't necessarily put it out there.

You kind of copied Eddie Woo; maybe come up with your example next time. Not saying, I am not thankful but you should honor other person work.

I love you Professor Sluiter

Step by Step makes sense!!

teacher thank's very much for having explained them carefully and well-deatiled, everything was clear ! , break a leg with your videos !

Really good.

Thank you very much. You help me solve the issue bothering me for a long time

where the 14 came from ? minute 7.58

Thank you for the thorough explanation of RSA. Very helpful.

How come these smart people not have millions of views. Thank you so much , very clear an precise explaination

Great explanation, thanks a lot!

Thanks for your video Professor Sluiter! I'am a brazilian student, and yours videos helpe me study!!

good explanation, however from your example you could have chosen multiple keys. This means that for each public key there are multiple private keys?

Make sure not to implement these with weak (less than 2048 bit) ciphers in real life!

confused during the explanation of the decryption where does the 32 mod 14 come from?

i am still lost on how to find the e and d. at the part where you choose a co-prime, and the entire process for d.

I simply loved the explanation, this was great. Your way of explaining the algo was quite smooth and smile. Thank you.

Best explanation on the internet 🎉

For I = 2 to (amount - 1): if (( amount mod I) = 0) then print I :next i

This one so far is the best explanation on RSA I have come across. Thank you, Prof!

In the real world, don't you need to make sure that N is large enough to cover the symbol range you wish to encrypt?
E.g. for alpha text, 1.. 26 --> T >= 27. And then you need two primes whose multiple is >= 27, say (3,11), (5,7). Of course it'll be (Yuge prime, Bigly prime), but I'm just asking about the "min" value for p, q.
Would 0.. 25 be allowed? It would handle the number of symbols, but I'm not sure if 0 would break any of the math.

I understand what's happening here, however nobody encrypts anything just to decrypt it again afterwards. You want to send the encrypted message to someone who can decrypt it. And you certainly don't send them your private key. And the receiver has their own private key, which is most probably based on different prime numbers. So, how does that work together with the public key?

Great job explaining this!!! I would take a class under this professor anytime.

Amazing! Thank you very much

Awesone explanation, Thanks so much! I'm not sure what I would've done without this tutorial

Brilliant explanation !!

Im lost how on how 5 is a number co prime with 6 and 14?

You are such a genius creature on the planet earth Prof Sluiter. Hats off!

really helpful man thank you

This video is so underrated, but the best on this topic I've seen. And I've seen A LOT. Thank you so much for this.

where does 14 came from ??????

encypting o with (5,14) give a, and decrypting a with (11,14) gives a.
how to get o instead of a after decryption?

for finding e, whyd you choose 14?? and how is 4 coprime for 6 and 14???

A great video.

wonderful explanation, thanks a ton.

So as far as I understand there can be more than 1 private keys d that work the exact same way to decrypt a message.Isn't that a vulnerability?

omg so simple and comprehensive explanation

great job!

Professional as usual! Thanks!

Your walkthrough in excell was very helpful. Thank you for the effort!

Finally. A good explanation on this topic with no skipped steps nor assumption about the viewers' previous knowledge. Amazing professor!

buy how does an computer decides which two huge prime numbers to chose? How does he know they are prime?

bilale anlatır gibi anlatmış. helal olsun!

THANK YOU SO MUCH YOU ARE A LIFE SAVER