Extended Euclidean Algorithm (Solved Example 3)

Network Security: Extended Euclidean Algorithm (Solved Example 3)
Topics discussed:
1) Calculating the Multiplicative Inverse of 11 mod 26 using the Extended Euclidean Algorithm.

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

#NetworkSecurityByNeso #Cryptography #NetworkSecurity #ExtendedEuclideanAlgorithm

[CrayonCats]

wow I wish I found this months ago, I've watched TONS of videos on this topic. This was easier than every single one of them by a mile. Thank You!

[achugh]

its a god gift that such a wonderful content is available for free.

[gujjewjetha]

Note for all the guys who are getting wrong answers. The main flaw of this explanation is that saying you put the greater value in A (A > B). By this logic, you're basically saying that we should get the same answer for the multiplicative inverse of 26 mod 11 (which would be 3) and the multiplicative inverse of 11 mod 26 (which is 19), and this is incorrect. To always get the right answer, ensure you take the mod first, that is if you want to find multiplicative inverse of 26 mod 11, apply extended euclidian on 4 and 11, instead of 26 and 11.

[mahmoud-a-raouf]

i try to find the modular inverse of 25 modulo 7 with your method and i get --7 and when i add 7 i get 0 but the correct ans is 2

[portraying_my_life]

What if multiplicative inverse comes i negative. As id did the ML inverse of 89 and 34, the inverse was -34 whereas the answer is 55 which is obtained by adding 89 and -34. Do we need to add T1 and T2 if the multiplicative inverse is in negative form??

[dipendughosh]

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

[animesh]

Sir, I wanted to know that till when the course playlist will be completed? Will it be completed by November end?

[pavani]

hi sir ☺. please complete DBMS subject , Java. I had them in my current semester. please 🙏🏼 🙏🏼 🙏🏼 🙏🏼 🙏🏼 🙏🏼 complete these subjects sir.please please please please please

[lochaniperera]

this method is not success with large numbers. 790 mod 121 try this. it is not success from this method. this is perfect for small numbers like 11 mod 26.

[monicabattacharya]

please complete discrete mathematics and datastructures ASAP

[evanmozumder]

multiplicative inverse of 42 mod 5 is 3 but the EEA gives 17....why is that?

[ujjawalkumar]

Sir I am getting inverse of 23 mod 26 as 11 .My value in T1 after the operation is -15 so when I add it to 26 I get 11.But the inverse actually is 17.What I am doing wrong??

[temexmichael]

The main flaw of this explanation is that saying you put the greater value in A (A > B). By this logic, you're basically saying that we should get the same answer for the multiplicative inverse of 26 mod 11 (which would be 3) and the multiplicative inverse of 11 mod 26 (which is 19), and this is incorrect. This made me make a big mistake smh

[gsivarani]

Sir, upload videos in FRENCH Language. Neso Academy - Languages channel.

[muradmishu]

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