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
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!!
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
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
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.
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
This method makes it so much easier to understand. Thank you!
I know right? The way it is organized makes much more sense to me
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)
Bro, Thank you !!!
Sir please complete this series with RSA/AES/DES/and Deffie Helman
To find T use T=T1-(T2xQ)
Thanks
Very clear method to get the multiplicative inverse
I don’t know how many adjectives will throw for you.. Just will say Thanx a lot..
very clear explanation, thank you so much ✨
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.
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
try 11 and 17
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!!
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
Method is correct, maybe u got -12 which is 35+12=47 i.e M.I of 35 mod 3
@@moonblade5838 No its 12 only , not -12
Even though you still speak fast😊😊.. . I love your teaching..🔥🔥🔥😊😊🔥💪🏿💪🏿💪🏿💪🏿
Thank you so much
Thank you so much, this makes EEA so clear!
Thanks sir!
kindly add videos of DES/AES and the rest.
Thank you so much sir love you ❤❤❤❤❤❤
Thank you sir ❤
Well explained...!!
Thank you!
It can also be used to find gcd of 2 co prime numbers if i am not wrong
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
Thanks
A small detail missed. If A > B then what we need to do?
:D If A > B then B = A, A=B
Aap bhagwati hain mere liye. Thank you so much. ❤❤❤❤❤❤❤❤
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.
Absolutely correct, While i work with various scenario of the multiplicative inverse i encountered an error.
Sir plz explain RSA...
Sir please upload remaining videos of data structures
I love you thank you
The GCD(1005,105)=15.
Am I correct?
while trying with 91 mod 12 the answer is not coming to 7 which is the MI
91mod12 = 7. If you start with A=12, B=7, T1=0 and T2=1, the multiplicative inverse will come as 7.
what is t full form in this video sir
Impressive
Complete data structure please
In this method gcd will be A not T1 . so sad .you guys just ruined my 4 marks by this wrong youtube keywords .
thats on you my guy, this video is for computing multiplicative inverse - not gcd
This is a wrong method
👏🙏
wakkali
Enna bro kaduppu agudha 💀
Ama thalaiva 😂