Extended Euclidean Algorithm (Solved Example 1)

Подписаться 2,6 млн

Просмотров 239 тыс.

50% 1

Network Security: Extended Euclidean Algorithm (Solved Example 1)
Topics discussed:
1) Explanation on the basics of Multiplicative Inverse for a given number under modulus.
2) Introduction to Extended Euclidean Algorithm to find the Multiplicative Inverse.
3) Steps and working of the Extended Euclidean Algorithm to find the Multiplicative Inverse.
4) Solved example to find the Multiplicative Inverse using Extended Euclidean Algorithm.
5) Explanation of how to verify the Multiplicative Inverse.
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

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

27 окт 2021

Ссылка:

Скачать:

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

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 51

@aliamaisara2095 Год назад

oh my god thank you sooo much for this explanation , really help me to understand for my exam tomorrow, hope ur day will be blessed ,always

@edwinsanchez1011 Год назад

Thank you so much, this makes EEA so clear!

@mohammadahmedragab837 Год назад

very clear explanation, thank you so much ✨

@mikerowaveoven509 2 года назад

Very clear method to get the multiplicative inverse

@masterleague8349 2 года назад

Sir please complete this series with RSA/AES/DES/and Deffie Helman

@shreyasingh222 2 года назад

Well explained...!!

@NareshKumar-kq5yz Год назад

To find T use T=T1-(T2xQ)

@souvikcseiitk Год назад

Thanks

@dbgohil124 Год назад

A point to be noted here is that if in final t1 we get negative ans then our final multiplicative answer will be (a+t1)

@yousofhajhasan8134 3 месяца назад

Bro, Thank you !!!

@alc5440 Год назад

This method makes it so much easier to understand. Thank you!

@BruceLee-qc2lm 8 месяцев назад

I know right? The way it is organized makes much more sense to me

@cradleofrelaxation6473 Год назад

I’m offering a course in cyber security called cryptography and steganography. Your channel has been really helpful!! So thank you!! I’m about to write a test and I’m only able to easily find the mod multiplicative inverse with the use of a good scientific calculator that has mod function. In case Calculator won’t be allowed in the test, so I’m looking for easy manual way of finding the inverse. But what I see here is scary!! In one of my workings i need the inverse of 441 mod 26. Obviously there’s no time for this Method. If Calculator isn’t allowed in the test, I’m screwed!! Mod multiplicative inverse is one such thing that shouldn’t be hard, BUT IT IS!!

@alaasmarneh7811 2 года назад

Thank you!

@ryanreefat1149 2 года назад

I don’t know how many adjectives will throw for you.. Just will say Thanx a lot..

@user-wk4ku6rw5u Месяц назад

Thank you so much

@iramshahzadi8297 Год назад

sir, please make a brute force attack example video, as you have already made a video on this topic, but if you choose a cipher text, then convert it into plain text , it will be easy for us . Regards

@shubham_jha Год назад

Thanks sir!

@manishkarmakar3927 2 года назад

kindly add videos of DES/AES and the rest.

@daviddugar3483 Месяц назад

Fun fact for this algorithm: the rule "A>B" is not neccesary, because the algorithm takes this into account by the way it behaves. For example if you have 3 mod 5 and take A = 3 and B = 5, then you get remainder 3 and quotient 0, so in the next iteration you would get A = B (which was 5) and B = remainder (which was 3). As you can see the algorithm takes care of that "point to ponder" by itself, you just waste 1 iteration tho

@danieldanmola8266 Год назад

Even though you still speak fast😊😊.. . I love your teaching..🔥🔥🔥😊😊🔥💪🏿💪🏿💪🏿💪🏿

@user-jh6gm4fh2m 8 месяцев назад

take A=modulo part , B=number part , ex: if we have to find MI of 20 mod 9 then take A=9 and B=20 then you will get correct ans.

@user-lb4dt1dz8r 7 месяцев назад

Thank you sir ❤

@cetadda4374 2 года назад

Sir please upload remaining videos of data structures

@nimmakajogeswararao7770 2 месяца назад

Thank you so much sir love you ❤❤❤❤❤❤

@shreyanshshukla2571 4 месяца назад

It can also be used to find gcd of 2 co prime numbers if i am not wrong

@adeodatusludan Год назад

Thanks

@architagarwal1367 Год назад

The Extended Euclidean Algorithm taught seems incorrect. It gives the M.I. of 35 mod 3 to be 12. However, 35 × 12 = 420 which is divisible by 3, hence not 420 is not congruent to 1 modulo 3, hence 12 is not M.I. of 35 mod 3

@moonblade5838 6 месяцев назад

Method is correct, maybe u got -12 which is 35+12=47 i.e M.I of 35 mod 3

@supriyosaha7450 2 года назад

Best Part.. This is not a mathematics class 😂😂😂😂😂😂😂😂😂😂😂😂😂

@samanthasavoy3490 Год назад

Ironically he made this concept far easier to comprehend than my discrete math textbook. Fantastic teacher!!

@md.saifulislamfaisal6546 9 месяцев назад

You must be the 4th idi*t. Multiplicative Inverse is part Matrix, which is part of mathematics!

@sastenashe_yt8802 2 года назад

Impressive

@poorvih Год назад

I love you thank you

@ShivamTh405 2 года назад

Complete data structure please

@salmanshahid8128 Год назад

Aap bhagwati hain mere liye. Thank you so much. ❤❤❤❤❤❤❤❤

@velsmusics326 Год назад

what is t full form in this video sir

@gourisworld4081 Год назад

Sir plz explain RSA...

@20aatif 2 года назад

A small detail missed. If A > B then what we need to do?

@luke9142 2 года назад

:D If A > B then B = A, A=B

@dipendughosh6730 9 месяцев назад

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

@gautham4232 7 месяцев назад

91mod12 = 7. If you start with A=12, B=7, T1=0 and T2=1, the multiplicative inverse will come as 7.

@sonegodwinngole5641 Год назад

The GCD(1005,105)=15. Am I correct?

@temexmichael1289 8 месяцев назад

Stating A should be greater than B is very misleading and flawed. Because, taking your own example 3, the multiplicative inverse of 26 mod 11 is 3, while the multiplicative inverse of 11 mod 26 is 19. But when you say you assign the greater value to A, you're implying they would both be the same. And you can only find the MI of 11 mod 26 using your method, which a flawed and inaccurate method.