Extended Euclidean Algorithm (Solved Example 2)
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.
Follow Neso Academy on Instagram: @nesoacademy (bit.ly/2XP63OE)
Contribute: www.nesoacademy.org/donate
Memberships: bit.ly/2U7YSPI
Books: www.nesoacademy.org/recommend...
Website ► www.nesoacademy.org/
Forum ► forum.nesoacademy.org/
Facebook ► goo.gl/Nt0PmB
Twitter ► / nesoacademy
Music:
Axol x Alex Skrindo - You [NCS Release]
#NetworkSecurityByNeso #Cryptography #NetworkSecurity #ExtendedEuclideanAlgorithm
Пікірлер: 30
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)
Homework problem answer: the multiplicative inverse of 10 mod 11 is 10.
MI of 10 mod 11 = -1 as we need a positive number ( 11 - 1) = 10 .... this is explained in the next lecture
please complete Database management systems ASAP
please completed datastructures and discrete mathematics
My answer to the homework is -1, why everyone says it's 10 ?
@KJ-jv8do
2 жыл бұрын
-1 is congruent to 10. (-1) + 11 = 10, therefore the MI of 10 mod 11 is 10.
@andrewstell6648
2 жыл бұрын
Watch example 3 video
-1 because T1 is the multiplicative inverse
Using EEA Table, we find MI = -1, 10 * -1 = -10 + 11 = 1.
H w answer -1 or 10
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?
@asishmagham7948
2 жыл бұрын
yes I got the same problem the problem occurs when a mod n here a>n
@krish4659
Жыл бұрын
@@asishmagham7948 so is it correct ? to use ?
@jd__k
6 ай бұрын
If it is like that first take 72 mod 7 it's 2 now a
HW: 10×10 ≡ 1 mod 11
Can you make a video on best books for gate cse please....🥺❤️
•'• 10 is the Multiplicative Inverse of 10 mod 11.
Sir complete your data structure vudeos
while trying with 91 mod 12 the answer is not coming to 7 which is the MI
multiplicative inverse of 10 mod 11 is 10
can you do 35 mod 3 plz
10 OR -1
but its not working for large number like 35 mod 3
@akashshrivastava8723
3 ай бұрын
35=(1,35) 3=(1,3) ans.=1
-1
10*10 = 1 mod 11, so, ANS = 10
In this method gcd will be A not T1 . so sad .you guys just ruined my 4 marks by this wrong info .shit
@averma4493
Жыл бұрын
We are not calculating gcd here... multiplicative inverse hai....
T1=Multi...in...=1??? 🥺