Asymmetric Key Cryptography: The RSA Algorithm by Hand
ฝัง
- เผยแพร่เมื่อ 16 ก.ย. 2024
- 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.
very clearly explained. This is the best explanation on the subject. Anybody now can understand what is very abstruse for the most.
Enjoying this little series from you, as it’s particularly well timed for my needs. :) love the range of content as always~
Thank you for the explanation that I could understand.
Mr. Kevin, thank you *very much* for putting together such beautiful tutorials!
You are very welcome. Thanks for the lovely comment. Your channel is fascinating :)KD
@@ComputerScienceLessons Hahaha xD I saw notification for my email first, that Mr.Kevin subscribed. I chuckled since my content is 'a bit' off from Computer Science subject (no pun intended). It's a great honor for me. And once again, I want to say how I can't thank you enough for your hard and invaluable work
That is MIND BLOWING! bravo
thank you so much for this video - I really like the demonstration!
You are very welcome
Nice series next time pls do make a video on PERT Chart for cambridge Alevel calculating slacktime etc etc
Amazingly explained, is it posssible for you to share excel sheet
nice
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?
Hashing
@@williamsmith255 Hashing the plaintext prior to encryption or the ciphertext post encryption would help prevent frequency analysis of the ciphertext, but it would also render the decryption theoretically impossible. Hashing is largely used for proofs as I understand it, not direct encryption. Care to elaborate?
Isaac cypher
I don't know if I missed something or what, but I was able to decrypt the message without the private key by simply taking the publicly known information and generating a lookup table.
If my analysis is correct, then this encryption method is little more than a keyed Ceasar Cipher?
Can someone enlighten me?
In practice, the rsa keys are used to transmit a truly random one-time-pad, which has no frequency content to attack with frequency analysis. Once both sender & receiver have the one-time-pad, they use that to encrypt a real message, and frequency analysis has no leverage against the resulting encrypted message
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?
I'm afraid not. Typically, you would not do this on a spreadsheet (I wanted to lay it out visually). Rather, you would do it programmatically. Most high level programming languages support very big numbers one way or another. :)KD
@@ComputerScienceLessons after some digging it seems the key is en.m.wikipedia.org/wiki/Modular_exponentiation
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.
can you share the excel sheet
I'll see if I can track it down :)KD
@@ComputerScienceLessons did you manage to track it down?
he picked 7 because it was cool ig