Asymmetric Key Cryptography: The RSA Algorithm by Hand

This video demonstrates the underlying principles of the RSA cryptosystem. It shows how the public and private asymmetric keys can be calculated from a pair of prime numbers. It also shows how to encrypt a message using the public key, and decrypt it using the private key. For ease, the calculations are performed with a spreadsheet, because the numbers involved in the process can be very large. The video points out that once a pair of asymmetric keys has been generated, the selection of which key should be made public and which key should be private, is arbitrary because RSA is a trap-door process.

[HandsomeOrHandy]

Thank you for the explanation that I could understand.

[TekCroach]

very clearly explained. This is the best explanation on the subject. Anybody now can understand what is very abstruse for the most.

[eveninrose]

Enjoying this little series from you, as it’s particularly well timed for my needs. :) love the range of content as always~

[MrDhawal]

Amazingly explained, is it posssible for you to share excel sheet

[egornashilov]

thank you so much for this video — I really like the demonstration!

[inarisound]

Mr. Kevin, thank you *very much* for putting together such beautiful tutorials!

[mustaffaqasim]

Nice series next time pls do make a video on PERT Chart for cambridge Alevel calculating slacktime etc etc

[Wolfeur]

So, if I get it right, the difficult part to break it is to find the totient of n, which requires to find the factors of n.

[chaemelion]

Excellent overview. It seems as though the ciphertext is vulnerable to frequency analysis and more, however. I'm assuming RSA is normally used in conjunction with other algorithms and techniques that effectively prevent such attacks?

[mikelwrnc]

Do you have a video on what is done to use larger primes and not encounter the representation errors you hit at the end of this one?