Тёмный

RSA Algorithm 

apurva59
Подписаться 97
Просмотров 61 тыс.
50% 1

Video states the RSA Encryption and Decryption

Опубликовано:

 

18 май 2016

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 37   
@mihirichathurikaamarasingh7396
Thank you very much for detailed explanation.
@diamantisufi7938
@diamantisufi7938 6 лет назад
Thank you, well explained!
@hussainal_shammari8599
@hussainal_shammari8599 5 лет назад
That’s a good explanation,Thank you so much
@richardslater677
@richardslater677 Год назад
What no one ever explains in these explanations is how this works in the real world, ie how this fits in with passwords etc.
@quanganhnguyen7252
@quanganhnguyen7252 4 года назад
very useful, thank you so much!
@nikoslymperopoulos90
@nikoslymperopoulos90 4 года назад
For anyone wondering m is the position of each letter in the alphabet, but because of numerical representation A has the position 0. So for A B C D E F G H I ... H is in the 7th position so for H m =7 and I is in the 8th position so for I m = 8 0 1 2 3 4 5 6 7 8
@amyth9004
@amyth9004 4 года назад
Great explanation... just that you included 9 as the options for the encryption key .. 9 is not a prime number. So it can’t be used as an option .. but overall amazing explanation for the RSA concept
@oussamamohamedbenali7773
@oussamamohamedbenali7773 4 года назад
THANK U VERY WELL EXPLAINED
@notknowing8978
@notknowing8978 6 лет назад
How does she combine values in the extended euclidean?
@brandonho6178
@brandonho6178 6 лет назад
lifesaver!
@ormanovmeirkhan7128
@ormanovmeirkhan7128 7 лет назад
best of the best
@knowledgeessentials101
@knowledgeessentials101 7 лет назад
Best !
@mardok68
@mardok68 Год назад
What about when you got a public key to show, typical what PGP would generate? A typical key-generation require you to make and remember the password. Noone remember all the characters of the private or public key, they are just two text files anyway. The key exchange is fascinating and also how they are made. Keys of 512bits or more. Pity the calculating force of regular comuters doesnt enable such to be shown ;)
@nesi_wilson1331
@nesi_wilson1331 5 лет назад
F#ck this .. I'm going back home to play super mario bros
@user-lf8cg6zn2g
@user-lf8cg6zn2g 6 лет назад
helpful
@ashwinsekaranbit
@ashwinsekaranbit Год назад
How the hell u guys saying understood here? @3.15 how come its 1 = 3(5) - 2 (7)???
@tikendrajitkeisham1427
@tikendrajitkeisham1427 6 лет назад
How did this come 3:15 ? 1 = 3(5) - 2 (7)
@thesciencebehind3247
@thesciencebehind3247 6 лет назад
combining common values
@andrewchen6791
@andrewchen6791 5 лет назад
1 = 5 - 2(7 -1(5)) 1 = 1(5) - 2(7) + 2(5) 1 = 3(5) - 2(7)
@redmoon5226
@redmoon5226 4 года назад
What if I want to encrypt by two leters HI, DE?
@amnesia3490
@amnesia3490 3 года назад
get ascii numbers or bytes
@starllama2149
@starllama2149 6 лет назад
8^7 == 2?? I'm lost someone explain
@pizzamaestro_
@pizzamaestro_ 5 лет назад
(8^7)/55. Cut off the decimal numbers and multiply the integer by 55 to get X. (8^7) - X is the answer.
@nailalzuhairi2690
@nailalzuhairi2690 5 лет назад
that's was fast. u need to slow down
@f5057
@f5057 7 лет назад
How 49^23 mod 55 calculated
@Prashantkrdey
@Prashantkrdey 6 лет назад
Use python. pow(49,23)%55
@tansvideos7193
@tansvideos7193 6 лет назад
in c you have to use modular exponentiation
@felentovic
@felentovic 6 лет назад
use wolfram alpha
@TheFefiiiii
@TheFefiiiii 6 лет назад
it's 4
@manojprajapati932
@manojprajapati932 5 лет назад
4:18 how from d = -17mod40 became d=23mod40 ???? please help
@ot2789
@ot2789 5 лет назад
Think of the modulus operation like a circle. Lets take this example X mod N. N being a positive integer. That means that the values that we can get by using this operation are the integers inside this interval [0,N-1]. Now why do we need to think it like a circle. If I go from 0 to N-1 by applying the modulus operation we get the same value. If I set X to N then the modulus operation will throw 0. If N+1 then 1. So it is like a circle. We start again from 0 after going for bigger values than N. By using the circularity of the operation we can write X = m(N) + v; Where m is a multiplication factor of N and v is a value inside the interval that we defined before. The modulus operation will remove the m times N part from your X always. Now what happens if we make m negative? We can easily readjust the equation by adding multiplications of N in order to make the value positive. For your comment now -17 mod 40 = (-17 + 40) mod 40 = 23 mod 40 The circle will be complete if we use the difference operator 23 - (-17) = 40
@ambikagollapudi5834
@ambikagollapudi5834 6 лет назад
How H = 7 here
@madheshreddy894
@madheshreddy894 6 лет назад
ambika gollapudi I was wondering the same thing. I guess it's like array.. Taking A as 0, B as 1 and C as 2, D as 3 and so on.
@tariq_dev3116
@tariq_dev3116 4 года назад
It is the corresponding thing called the ascci value for characters .each character and symbol or number in english is represent in an specific ascci value so we can use it in such things and for example programming or information security
@tariq_dev3116
@tariq_dev3116 4 года назад
Sorry i guess am wrong
@unkown46
@unkown46 4 года назад
Hi
@qortezztuala9106
@qortezztuala9106 4 года назад
Go brush you’re teef
Далее
How does RSA Cryptography work?
19:40
Просмотров 63 тыс.
Public Keys Part 2 - RSA Encryption and Decryptions
9:04
Stay on your way 🛤️✨
00:34
Просмотров 7 млн
would you eat this? #shorts
00:36
Просмотров 2,2 млн
RSA algorithm step by step example
20:41
Просмотров 105 тыс.
Secret Key Exchange (Diffie-Hellman) - Computerphile
8:40
Public Key Cryptography: RSA Encryption Algorithm
16:31
Encryption and HUGE numbers - Numberphile
9:22
Просмотров 1,3 млн
What are Digital Signatures? - Computerphile
10:17
Просмотров 327 тыс.
RSA digital signatures
9:38
Просмотров 440
Modular exponentiation
11:37
Просмотров 282 тыс.
Stay on your way 🛤️✨
00:34
Просмотров 7 млн