RSA encryption in 5 minutes

[krzyy]

Don't know if this helps but:

1. Choose 2 large prime numbers P and Q.
2. Calculate N = P x Q
3. Select the public key E such that it does not have a common factor as (P-1) x (Q-1).
4. Select the private key D such that: (D x E) mod (P-1) x (Q-1) = 1
5. For encryption, calculate the cipher text CT from the plaintext PT as follows: CT = PT^E mod N
6. Send CT as the cipher text to the reciever
7. For decryption, calculate the plaintext PT from the ciphertext CT as follows: PT = CT^D mod N

[jadenthepro]

G-R-E-A-T WORK THE PICTURES MAKE IT VERY UNDERSTANDABLE

[russell]

e is introduced out of nowhere and is never explained.

[lifeliver]

Amazing. Beautiful. Helpful. I could not have asked for a better video on the topic

[russind]

Thanks for the video - it really helped me to understand RSA encryption in a short period of time.

[medoalmouhtadi]

there are 3 people explaining in a 5 minutes video... great.

[alecmcehinny]

Awesome video! I believe it is Fermat's Little theorem, unless there are alternative spellings for his name

[johmsauce]

I just watched this for the lols I have no clue what this is saying

[melicalol]

Thanks for the vid, was great to learn from you

[thecqf]

For the first time in my life I had to slow a video down

[zivllaganegil]

N O I C E - it's clear and understandable!

[thecatmano]

video cut
rapping faster than eminem
.. Uh, summa-lumma, dooma-lumma, you assumin' I'm a human
What I gotta do to get it through to you I'm superhuman?
Innovative and I'm made of rubber so that anything
You say is ricochetin' off of me, and it'll glue to you and
I'm devastating, more than ever demonstrating
How to give a motherfuckin' audience a feeling like it's levitating
Never fading, and I know the haters are forever waiting
For the day that they can say I fell off, they'll be celebrating

[trilingualkid]

you lost me at your 3 lines equal sign....

[warsamesultan]

Show us the steps to get to e=35 help man

[wenukagunarathna]

On equation at 2:36, the mod n should be on the other side of the equation, right? C=M^k mod n

[yoavtamir]

Thanks this was a high quality content and helped me a lot

[SzTz]

What's the rush, it's not a race

[jimpeschke]

Less caffeine, please. The narration of the example was about 3X what it should have been.

[aashsyed]

Please understand it . Explain slowly this sounds like garbage slowly explaining it will be good

[grahambond]

I have RSA deciphered from boredom :-)
mod(n, round(x))=0 gives immediately p and q