Asymmetric Key Cryptography: The RSA Algorithm by Hand

  Рет қаралды 12,067

Computer Science

Computer Science

Күн бұрын

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.

Пікірлер: 27
@TekCroach
@TekCroach 2 ай бұрын
very clearly explained. This is the best explanation on the subject. Anybody now can understand what is very abstruse for the most.
@eveninrose
@eveninrose 5 жыл бұрын
Enjoying this little series from you, as it’s particularly well timed for my needs. :) love the range of content as always~
@HandsomeOrHandy
@HandsomeOrHandy Жыл бұрын
Thank you for the explanation that I could understand.
@d.w.714
@d.w.714 11 ай бұрын
That is MIND BLOWING! bravo
@egornashilov5449
@egornashilov5449 5 жыл бұрын
thank you so much for this video - I really like the demonstration!
@ComputerScienceLessons
@ComputerScienceLessons 5 жыл бұрын
You are very welcome
@mustaffaqasim
@mustaffaqasim 5 жыл бұрын
Nice series next time pls do make a video on PERT Chart for cambridge Alevel calculating slacktime etc etc
@MrDhawal29
@MrDhawal29 3 жыл бұрын
Amazingly explained, is it posssible for you to share excel sheet
@mikelwrnc
@mikelwrnc 2 жыл бұрын
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?
@ComputerScienceLessons
@ComputerScienceLessons 2 жыл бұрын
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
@mikelwrnc
@mikelwrnc 2 жыл бұрын
@@ComputerScienceLessons after some digging it seems the key is en.m.wikipedia.org/wiki/Modular_exponentiation
@chaemelion
@chaemelion 5 жыл бұрын
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?
@williamsmith255
@williamsmith255 5 жыл бұрын
Hashing
@chaemelion
@chaemelion 5 жыл бұрын
@@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?
@superpb600
@superpb600 5 жыл бұрын
Isaac cypher
@fredjenkins5069
@fredjenkins5069 3 жыл бұрын
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?
@mikelwrnc
@mikelwrnc 2 жыл бұрын
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
@Wolfeur
@Wolfeur 5 жыл бұрын
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.
@GodIsEverPowerful
@GodIsEverPowerful 4 ай бұрын
nice
@inarisound
@inarisound 4 жыл бұрын
Mr. Kevin, thank you *very much* for putting together such beautiful tutorials!
@ComputerScienceLessons
@ComputerScienceLessons 4 жыл бұрын
You are very welcome. Thanks for the lovely comment. Your channel is fascinating :)KD
@inarisound
@inarisound 4 жыл бұрын
@@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
@MrDhawal29
@MrDhawal29 3 жыл бұрын
can you share the excel sheet
@ComputerScienceLessons
@ComputerScienceLessons 3 жыл бұрын
I'll see if I can track it down :)KD
@KamiK4ze
@KamiK4ze 2 жыл бұрын
@@ComputerScienceLessons did you manage to track it down?
@jamesmatthews2751
@jamesmatthews2751 2 жыл бұрын
he picked 7 because it was cool ig
Cryptocurrency. Part One: Money
11:57
Computer Science
Рет қаралды 6 М.
How does RSA Cryptography work?
19:40
Tom Rocks Maths
Рет қаралды 68 М.
Inside Out 2: BABY JOY VS SHIN SONIC 3
00:19
AnythingAlexia
Рет қаралды 8 МЛН
АЗАРТНИК 4 |СЕЗОН 2 Серия
31:45
Inter Production
Рет қаралды 1,1 МЛН
Asymmetric Key Cryptography
8:46
Computer Science
Рет қаралды 11 М.
Public Key Cryptography: RSA Encryption Algorithm
16:31
Art of the Problem
Рет қаралды 935 М.
RSA algorithm step by step example
20:41
Programming w/ Professor Sluiter
Рет қаралды 107 М.
The RSA Encryption Algorithm (1 of 2: Computing an Example)
8:40
Paper and Pencil RSA (starring the extended Euclidean algorithm)
7:31
RSA Encryption From Scratch - Math & Python Code
43:30
NeuralNine
Рет қаралды 30 М.
Public Key Cryptography - Computerphile
6:20
Computerphile
Рет қаралды 895 М.
RSA Private & Public Key Encryption in Python
12:42
NeuralNine
Рет қаралды 54 М.