Тёмный
Jenn Janesko
Jenn Janesko
Jenn Janesko
Подписаться
Robot...
0:13
4 года назад
Furby Fx
0:12
4 года назад
Exponential Growth
1:05
4 года назад
Thing a Decade:  Girl Admin
3:09
8 лет назад
Комментарии
@user-ko1wg7zg6b
@user-ko1wg7zg6b 7 месяцев назад
we have a math project that is due today but we were stuck in the RSA question for hoursss and you have saved our life at the last second for REALL thanks😭😭😭😭
@AliRachid
@AliRachid 8 месяцев назад
God bless you. I had a homework, and they did not show us how to handle a negative private key. Thank you very much. If I could give you hundreds of likes, I swear I would do.
@mahdinouira3261
@mahdinouira3261 10 месяцев назад
i got stuck while trying it with this equation 20 x + 3 y = 1
@sumaiyatabassum654
@sumaiyatabassum654 11 месяцев назад
thank you so much
@codonbyte
@codonbyte Год назад
I procrastinated on an assignment that I shouldn't have procrastinated on, and this actually saved my life.
@salmanelbadessi1922
@salmanelbadessi1922 Год назад
In the 3rd part where you chose e, you included the number 9 which is not a prime number. Otherwise, Great video and very helpful!
@harihitaaramesh1086
@harihitaaramesh1086 Год назад
Suppose, using RSA for two prime numbers resulted in encryption and decryption keys having the same values. (Decryption key solved as in video). Is it alright? If not, how to proceed further?
@saralagab4036
@saralagab4036 Год назад
thank u very much ,u saved me
@moizkhan2359
@moizkhan2359 Год назад
cool robot >_<
@cedric1731
@cedric1731 Год назад
Literally saving me rn!
@youtube_username_
@youtube_username_ Год назад
Thank you - I was able to use your explanation to write a couple of functions to perform the same procedure.
@isaackim9181
@isaackim9181 Год назад
this deserves the noble peace prize
@reeforeefo4087
@reeforeefo4087 2 года назад
how the hell do you get from 1 = 5-2(7-1(5)) to 1 = 3(5)-2(3)
@lushenmoodley771
@lushenmoodley771 Год назад
I also got confused with this step but I get what happened now. So when we multiply the -2 into the brackets, we will get -2(7) and +2(5). Now we also have the 5 in the front which is basically 1(5), so +2(5) and 1(5) are like terms (the 5 is common) so we add the numbers in front and get 3(5). So that will give us 3(5) and -2(7) Hope this helps
@nesrinebensadok2460
@nesrinebensadok2460 2 месяца назад
​@@lushenmoodley771 I was also confused .....thank you for the explanation
@roypaulnarido1052
@roypaulnarido1052 2 года назад
so in the e of the first example can be 3 also?
@OracleOfSages
@OracleOfSages 2 года назад
The third step of the back substitution makes no sense. How did you get 3(5) - 2(7)?????????
@lushenmoodley771
@lushenmoodley771 Год назад
I also got confused with this step but I get what happened now. So when we multiply the -2 into the brackets, we will get -2(7) and +2(5). Now we also have the 5 in the front which is basically 1(5), so +2(5) and 1(5) are like terms (the 5 is common) so we add the numbers in front and get 3(5). So that will give us 3(5) and -2(7) Hope this helps
@soa99
@soa99 2 года назад
how did you came up with the 3 at the end
@CheteauPape
@CheteauPape 3 года назад
Finally understand,thanks!!!💕💕💕
@bouabdellahtahar5126
@bouabdellahtahar5126 3 года назад
whey you chose e=7 you can chose e=3?
@louaykhammar7268
@louaykhammar7268 3 года назад
Fastest and clearest video of this algorithm -- perfect, thanks!
@war.on.buffets4170
@war.on.buffets4170 3 года назад
Thank you!!
@KoryGraphic
@KoryGraphic 3 года назад
This makes no sense at all lol
@honnyboy95
@honnyboy95 3 года назад
private keys are (11,5,23)
@nolanlego
@nolanlego 3 года назад
Wow, thanks so much! I've been trying to understand it for weeks and the TA and professors kept telling me it's super simple and wouldn't help me. They were right, it's super simple! But you actually helped me, thanks!
@galfrasian
@galfrasian 4 года назад
Why are we taking e=7 and not e=3??
@hinakanwal5849
@hinakanwal5849 4 года назад
Thank you so much...best video on RSA
@user-fo8sn7mw6z
@user-fo8sn7mw6z 4 года назад
this is fucking annoying to learn holy shit
@DanielGutierrez3007
@DanielGutierrez3007 4 года назад
Amazing! i'm so grateful, nice video.
@aw4704
@aw4704 4 года назад
THANK YOU!! MERCIE!! CHOKRAN!! ARIGATO!!
@eatens
@eatens 4 года назад
you said if the number infront of 7 was positive we would be done. then in that case, what is d????, you only explained how to get d if the number infront of 7 was negative
@WanderingFriar
@WanderingFriar 4 года назад
2:20 - 9 is not a prime number? Because 3x3? Good explanation for RSA though. Help me understand a bit more. Thanks.
@ait-gacemnabil9181
@ait-gacemnabil9181 3 года назад
she didn't say prime , she said RELATIVELY prime with 40 , which means it shares with 40 one common devisor : 1
@devinramsden5412
@devinramsden5412 4 года назад
much love
@abedismyname
@abedismyname 4 года назад
thanks it helped explain things
@zeuscesar
@zeuscesar 4 года назад
Honestly you just save me! great explanation! I was a bit lost
@arabiclive007
@arabiclive007 5 лет назад
5 is also prime....
@JL-sn1wn
@JL-sn1wn 5 лет назад
life saver
@TayoEXE
@TayoEXE 5 лет назад
What is p? What is q? What is n? What is up with teachers always saying "This is what p is!" and just equate it to some other equation. I mean WHAT IS THE MEANING OF IT? What function does it serve? Why do we need it?
@JennJanesko
@JennJanesko 5 лет назад
p is a placeholder that is equal to a prime number that you choose. q is a placeholder that is equal to a prime number that you choose. "p" and "q" can be any prime numbers. The second that you choose them, they have to remain fixed for the remainder of the calculations for the public and private keys.
@hattrickster33
@hattrickster33 5 лет назад
Great video. I'm in computer science but I've never liked doing theoretical math and proofs. I'll do it if there's a practical application in an algorithm I need to understand, but I usually try to avoid it. This was a great explanation because you got to the point and explained everything very clearly.
@I_once_loved_too_much
@I_once_loved_too_much 5 лет назад
Great Video. But Can Someone Say How did we get 1= 3 (5) - 2 (7)??
@ankitabasu7242
@ankitabasu7242 6 лет назад
modular multiplicative inverse{d = ee−1(mode φ(n) ) } where : e=27 and n=55 please help me calculate 'd' and the pseudo RSA algo is
@tv..6531
@tv..6531 6 лет назад
KPop+KMath: Do you know relationship of 'Extended Euclidean Algorithm' and 'Nucha Binary Operation'? I'll Show You!!! ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-gi1CVjZVENA.html
@ManjunathPrabhakar
@ManjunathPrabhakar 6 лет назад
Can show encryption and decryption for the same if M = 88
@nate22621
@nate22621 6 лет назад
Great explanation
@EbraM96
@EbraM96 6 лет назад
In Euclidean algorithm if you make m steps, you will have to make m steps in substitution to reach the answer. Hope this helps to clear things out.
@rabarrasool757
@rabarrasool757 6 лет назад
how choose e=7 ?
@zelimkhan7126
@zelimkhan7126 6 лет назад
thanks a lot, your explanation is clear and simple... you are awesome :)
@Cryogeneses
@Cryogeneses 6 лет назад
You said at the end that if 17 was positive and not negative, that we would be done. If that were the case and it was 1 = 3(40)+17(7) what would d equal?
@JennJanesko
@JennJanesko 6 лет назад
Hi Cryophilic, if 17 were positive, then d would simply be 17.
@Cryogeneses
@Cryogeneses 6 лет назад
Ok thank you
@shafigilanizadeh7726
@shafigilanizadeh7726 6 лет назад
thank u, its very helpful vedeo
@BIRD_LOVERS-OFFICIAL
@BIRD_LOVERS-OFFICIAL 6 лет назад
ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE--EvXnJyUReA.html
@ludos4153
@ludos4153 6 лет назад
Hello, i think there is some issue with your calculations.. (M^7|55)^23|55 == (M^7|55)^3|55 == (M^7|55)^43|55 .. i think that hacker should not be able to use other private key to decode the staff other then the one..
@chinnaraogolagani3249
@chinnaraogolagani3249 7 лет назад
why are u taking 7, 3 is also thee