Extended Euclidean Algorithm (Solved Example 2)

preview_player
Показать описание
Network Security: Extended Euclidean Algorithm (Solved Example 2)
Topics discussed:
1) Calculating the Multiplicative Inverse of 11 mod 13 using the Extended Euclidean Algorithm.
2) Verifying the Multiplicative Inverse obtained using the Extended Euclidean Algorithm.

Music:
Axol x Alex Skrindo - You [NCS Release]

#NetworkSecurityByNeso #Cryptography #NetworkSecurity #ExtendedEuclideanAlgorithm
Рекомендации по теме
Комментарии
Автор

Answer to H.W. : M.I. = -1 of 10 mod 11. To express the inverse as one of the residues {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, we add -1 to 11 to obtain (-1+11) = 10.

Verification : 10*10 mod 11 = 1. (True)

rajeshprajapati
Автор

MI of 10 mod 11 = -1 as we need a positive number ( 11 - 1) = 10 .... this is explained in the next lecture

ritidipsarkar
Автор

Homework problem answer: the multiplicative inverse of 10 mod 11 is 10.

utilizator
Автор

Using EEA Table, we find MI = -1, 10 * -1 = -10 + 11 = 1.

SequinBrain
Автор

-1 because T1 is the multiplicative inverse

neerajkumari
Автор

My answer to the homework is -1, why everyone says it's 10 ?

mohannadatmeh
Автор

•'• 10 is the Multiplicative Inverse of 10 mod 11.

Karan-y
Автор

Can you make a video on best books for gate cse please....🥺❤️

PradeepVerma-xhfm
Автор

please completed datastructures and discrete mathematics

monicabattacharya
Автор

please complete Database management systems ASAP

pavani
Автор

multiplicative inverse of 10 mod 11 is 10

skgeddha
Автор

hi, for problem '72 (mod 7)' I get multiplicative inverse number 31 (with method-table Q, A, B, R, T1, T2, T). But when I try to solve with C=1*72/7, C=2*72/7.. I get C=4 answer (4*72=288/7=41 residue 1). Why so?

svetitoto
Автор

what about this using this method.
102 mod 19

lochaniperera
Автор

while trying with 91 mod 12 the answer is not coming to 7 which is the MI

dipendughosh
Автор

Sir complete your data structure vudeos

dogsgallery
Автор

but its not working for large number like 35 mod 3

YeniyanSemman-xhcj
Автор

In this method gcd will be A not T1 . so sad .you guys just ruined my 4 marks by this wrong info .shit

muradmishu