Multiplicative Inverse

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

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

50% 1

Network Security: Multiplicative Inverse
Topics discussed:
1) Explanation on the basics of Multiplicative Inverse for a given number.
2) Explanation on the basics of Multiplicative Inverse for a given number under modulus.
3) Finding the Multiplicative Inverse for smaller numbers manually.
4) Difference between the Multiplicative Inverse of normal numbers and numbers with modulus.
5) Explanation on how to determine whether there exists a Multiplicative Inverse or not.
6) Introduction to Extended Euclidean Algorithm to find 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 #MultiplicativeInverse

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

21 июл 2024

Ссылка:

Скачать:

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

Добавить в:

Мой плейлист

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

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

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

Everytime i search for math related lecture in English i always have a thought my English must be poor that's why i am not understanding but when i see your lecture my all doubts gets cleared.

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

❤

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

Great explanation! Thanks!

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

This really helped out

@sadiashaheen7361 Год назад

Wonderful Explanation 🔥🔥

@imRJD14 Год назад

Chill explanation Thanks 🙏🏻

@anekechinaemerem6601 Год назад

Thank you so much! You are the best!!! ❤️

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

I can not wait for the next lesson.

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

man you are the BEST EVER!

@letsimage Год назад

thanks! But could you tell please, why do we use it?

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

Great, Explanation

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

Thank you sir! You slayed this.

@Limegreenslice 10 месяцев назад

Great video, thanks!! I was sitting here scratching my head on why my crypto book kept telling me the multiplicative inverse of 3 is 9 and not 1/3 until i found your video. Mod, gotta remember that mod

@user-ig8pg8ov9y 3 месяца назад

Thank you! Finally I understood how calculate multip.inverse

@isirlasplace91 Год назад

Thank you!!! I couldn't wrap my brain around this concept and you explain it so well!!!

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

Thanks for your efforts ♥

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

thank you sir best explaining

@Aaronmx12 10 месяцев назад

Your videos have been very helpful, much appreciated! 1 issue though, I believe [ a mod b ] where a is less than b is equal to a. (ex. 2 mod 5 = 2, because 2 is less than 5 and therefore the remainder). You mentioned 2 mod 5 = -3, so you then perform 2 x 3 = 6 then 6 mod 5 = 1 which is different from 2 mod 5 being equal to 2.

@user-yc9vl8dy8f 6 месяцев назад

if you subtract 5 from 2 you get remainder as -3 as 2-5*1 is -3 it's on the other side of positive modulus...

@user-vo2ny8sj7w Год назад

Great video

@Black-xy4pj Год назад

When you say 2 into 4 it means division. When referring to multiplication you should use the word 'times' instead. I was confused through certain parts of the video. Great video though; I now understand.

@vamppyre 5 месяцев назад

Can there be more than 1 multiplicative inverse? Like for 3(mod 5) you said multi inverse is 2. Even 7 can be it's inverse right, because 7*3=21 and 21 mod 5 = 1.

@Foruni-hw6uz Год назад

Nice one!

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

Thank you

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

thanks man

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

for small numbers we can find it out easily what about for large numbers how to find can you give me some tips for that

@SachinKumar-fd2kg 2 года назад

Sir I have an assignment ,can you help me?

@hannanhub1717 Год назад

simple explanation

@vEr5eX Год назад

You mentioned in a few parts about -1 as remainder. Would you mind explaining how come there can be negative remainders? Shouldn’t remainders only always be positive?

@barackobama5867 Год назад

when you have x=-1 mod n that is same as x=n-1 mod n

@iLieOfficial Год назад

even if we get -ve remainder it is simply = to the inverse of it.

@lindeanchuang8115 Год назад

Thanks for the subtitles.

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

ty, this is EXACTLY what I didn't understand about these things. So from what you said, a relative prime will never be two even numbers, but will always be either even/odd or odd/odd. Clearly, sometimes even those won't work, but we will never have two even numbers which are relatively prime.

@faisalhisham4685 Год назад

you are the best

@iosonoi.7132 4 месяца назад

Oh, I get it now. For any of you struggling, its just the notation that is "unintuitive". if you see 1 mod 5, its not literally 1 mod 5, its 1 (mod 5). So 1 "when you mod by 5". Instead of 3*n = 1 (mod 5) i think the simplest way of understanding it is putitng it in "normal" notation. (3*n) mod 5 = 1 6 mod 5 = 1, so n=2

@chamin111 Год назад

Thank you so much sir . I watched many videos about modular inverse, but didnt understand. I understood very easily from your video. Thank you so much

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

hapo safi nimeelewa sana mkuu

@mauthoormotasim6332 Год назад

but how do we calculate it when we have large numbers?

@nitac2237 Год назад

he said that at the end of the video. by extended euclidean algorithm

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

when can we expect a video of DES Algorithm?

@user-gz6tb8yw2v 11 месяцев назад

4 * 4 = 16 here incase if we divided 16/5 thn the reminder would be 3.2 not the 1 and since the mod is 5 we can do this by 4*1 = 4 by this we get reminder as 1

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

see properly reminder is 1 ur being mistaken b/w reminder and quotient

@Mehraj_IITKGP Год назад

For large numbers, use : a^-1 mod p = a^(p-2) mod p, where p is prime.

@sayharshu 10 месяцев назад

Is this a theorem or just a simple formula?

@Mehraj_IITKGP 10 месяцев назад

@@sayharshu this is Fermat's Little Theorem

@sayharshu 10 месяцев назад

@@Mehraj_IITKGP thankyou brotha :)

@mr.a8130 Год назад

thanks sir i did not uderstand anything

@iramshahzadi8297 Год назад

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

I know two ways for finding inverse Euler's theorem extended Euclidean algorithm

@alexsedgwick4546 Год назад

next time write it out. i got it when I went back

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

Bro what is 24 x ? = 1 mod 26

@user-ic6my1kg6c 4 месяца назад

Gcd (24,26)=\=1 inverse will not exist in this case

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

❤️❤️❤️

@ToanPham-wr7xe 21 день назад

😮

@abdulhaq5263 Год назад

4 is not prime 🙄, how is it relatively prime of 5?

@sanjana6931 Год назад

Relatively prime and prime are different. Two numbers are relatively prime if they don't have a common factor. 4 and 5 don't have a common factor other than 1 so they r called relatively prime