Тёмный

Multiplicative inverse of a number in Cryptography 

Abhishek Sharma
Подписаться 128 тыс.
Просмотров 86 тыс.
50% 1

Extended Euclidean :
• Extended Euclidean Alg...

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

 

5 дек 2019

Поделиться:

Ссылка:

Скачать:

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

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 21   
@muhammadnajh6859
@muhammadnajh6859 4 года назад
great , thank you alor. what about additive inverse?
@MuhammadShumailNadeem
@MuhammadShumailNadeem 2 месяца назад
Find the multiplicative inverse of 23 module 220
@vinayaksharma7134
@vinayaksharma7134 2 года назад
4:40 is a v.v.v.v. imp point which was not covered on any video on youtube....Thank you very much Abhishek Sir for covering this point...!!!!!
@sowbaranikag6514
@sowbaranikag6514 8 месяцев назад
Thankyou I didn't watch the full video ,I watched till -7 answer, but I saw ur comment and came to know! Thanks a lot!
@sourabhkumar6194
@sourabhkumar6194 4 года назад
make a video on linear diophantine equations thanks for the video
@devkadia9376
@devkadia9376 2 года назад
How to calculate if the figure is 43 mod 64? Pls do let me know
@jahangagan5396
@jahangagan5396 4 года назад
this method works for me almost times but for-finding 33 inverse this method founds to be wrong can u please help me out?
@soniverma7107
@soniverma7107 3 года назад
Thanks bhaiya best explained 😊
@yifuxero9745
@yifuxero9745 7 месяцев назад
Here's an easier way. Take 11/26 and write out the continued fraction representation, = [2, 2, 1, 3]. Underneath write the convergents = [1/2, 2/5, 2/7, 11/26]. From the rightmost denominator (26), subtract the denominator to the left (7), giving 19, the answer. This rule applies to an even number of partial quotients (we have 4). For an odd number, we just record the denominator to the left of the rightmost denominator. Say we want the multiplicative inverse of 5 mod 21. We get [4, 4, 1] and underneath our convergents are [1/4, 4/17, 5/21]. Denominator to the left of the 21 is 17, the answer since 5 * 17 = 85 = 1 mod 21; (correct).
@sadiaafrose7166
@sadiaafrose7166 2 года назад
THAAAAAAAAANKS A TON!
@riteemaharjan4351
@riteemaharjan4351 4 года назад
Have you made video on galois field?
@AbhishekSharmaDit
@AbhishekSharmaDit 4 года назад
No
@sreeharitanil885
@sreeharitanil885 3 года назад
Will this method work if gcd(26,n) not equal to 1 ?? Please reply !!
@dr.jasvantkumar7824
@dr.jasvantkumar7824 3 года назад
Multiplicative inverse exists if gcd(a, b)=1
@riteemaharjan4351
@riteemaharjan4351 4 года назад
You are great yar
@shrutichauhan287
@shrutichauhan287 7 месяцев назад
can we get notes pdf?
@mahnoorahmed5536
@mahnoorahmed5536 3 года назад
How to calculate 26 inverse mod 11?
@adarshshukla2055
@adarshshukla2055 Год назад
Bro have you done this question using extended euceldian method?
@Legend_f_f
@Legend_f_f Год назад
Op teacher
@architjindal908
@architjindal908 3 года назад
Sir for 135 mod 61 this method is not giving the correct answer. Could you please check it out?
@rajatsingh3904
@rajatsingh3904 3 года назад
Sir you are here also ;)
Далее
Finding the modulus of a negative number
11:59
Просмотров 69 тыс.
Extended Euclidean Algorithm - Example (Simplified)
7:40
Multiplicative Inverse
10:03
Просмотров 216 тыс.
GCD - Euclidean Algorithm (Method 1)
14:38
Просмотров 517 тыс.
Extended Euclidean Algorithm (Solved Example 1)
10:16
Просмотров 237 тыс.