Chinese Remainder Theorem | Cryptography And Network Security

[@zaidhere7472]

Thanks, I understood from Ur video.

[@rravindran7922]

35^-1 mod 3=35-(multiples of 3

[@vikassahu2631]

bhai kuch samajh ni aaya 11 kaha se aagya

[@Kavincholan]

Very nice video and easily understandable. If the number is not prime for eg 385 inverse 9. What is the answer can u please explain.

[@folome145]

Love you brother,god bless you finally understood.

[@mohammadhoseingholamrezaei2714]

Thanks. It was really helpful.

[@meghanakrishnan9240]

Thank you... It was very helpful. 😊

[@bhavanans3273]

thank u soo much for such good explanation in short time!

[@ixenroh]

That inverse finding is weird.. the inverse is simply the remainder.. so like 35 mod 3... 33 is the highest thing you can get by multiplying 3, as in 33 is the highest multiple of 3, therefore 2 is the remainder. Easy.

[@boyvsdreams]

thank you so much 💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖💖

[@saugat512k]

thank u brother...love from nepal

[@iamsafy6461]

Thanks a lot 💕💕💕

[@keepgetmovin]

Thanks yrr. Mko bas M inverse smjh ni ara tha.. ♥️ kl exam h

[@tejaswinibegur5091]

very well explained. thank u

[@QuickTrixx]

you are welcome.

[@MonuKumarSahgal]

kyunki differ diffir book me alag alag samjha rakha h,aur answer bhi different aa RHA h

[@earthtoakash]

Why we put -2 in power??

[@QuickTrixx]

Akash Purohit thanku for the doubt. Please watch our video of How to find inverse using fermats little theorem. I am providing you the link. kzbin.info/www/bejne/gWXXo3eeeLV8hZo Keep watching Keep sharing.

[@TECHMFK]

How to find y1 if 12.y1 congruent to 1 (mod 5)

[@apexplores3231]

12.y1 (mod 5) = 1 => y1 is the inverse of 12 Also, 12*3=36 and 36 (mod 5) = 1 Hence, y1 = 3

[@dharnakataria1360]

Can you plz clearly explain inverse why we all tym use 2 like 35^3-2 mod 3 and 21^7-2 mod 5 why we always use that 2

[@QuickTrixx]

It is fermat rule 😊

[@antonygeorgenixon9322]

Thank you so much

[@infantalincy6471]

sir how to find a(mod b) in calsi ....plz explain clearly

[@prashanthadepu3013]

use mixed fraction

[@bud_yhunter3940]

Thnx man!!

[@haridharani9357]

well understood.. thank you

[@QuickTrixx]

thank you for watching hari. Keep watching and keep sharing

[@QuickTrixx]

WELCOME :)

[@aniketyadav2989]

Instead of step 3 we can apply formula :- M1^(-1)=M1mod m1 M2^(-1)=M2mod m2 M3^(-1)=M3mod m3

[@MonuKumarSahgal]

mujhe inverse waala logic samajh nhi aa RHA h

[@kiranpradhan3731]

if the "Mk" is not a prime no. then how can I solve the M inverse.... plz tell me

[@QuickTrixx]

Hello kiran , it is prime number apply inverse using fermat little theorem When it is not prime use inverse using eulers theorem Click here to watch inverse using euler theorem kzbin.info/www/bejne/o4bafYxmpZp8hqc

[@varaprasanthidevi29]

tk you

[@azumamurakami7842]

X=2 mod3 X=3 mod5 X=2 mod7 -------------------------- 3X5X7=105 35X=70 mod105 ---------(1) 21X=63 mod105 ---------(2) 15X=30 mod105 ---------(3) (1) - (3) 20X=40 ------------------------(4) (2) - (4) X=23 mod105 Ans. 23

[@westronic]

Very helpful, thank you! To apply to Network Security, I assume X is the "secret." Then each congruence is assigned to a person, and a certain number of people must collaborate to find X. This makes X more secure, am I right?

[@balajianand6251]

Gud!!!

[@abhinavsaraogi8990]

Sir mod kese nikalte h calculator me. I mean formula kya hota h mod nikalne ka? Plz tell

[@QuickTrixx]

watch my video i have uploaded -- kzbin.info/www/bejne/nKTbnKCJa9F-nc0

[@yashbhosle98]

Thanks😊 But I feel like that white board was too big for you to get over it for writing😜

[@TARANGVERMABCE]

thanks very much...\

[@shubhidwivedi3094]

abey chuytiya

[@rishabhbaghel4579]

gazab yaar

[@QuickTrixx]

Ty 😄 try upload remaining topics of crns

[@dharnakataria1360]

If m1 m2`s value are not prime then how can we find inverse

[@kiranpradhan3731]

QuickTrixx no sir I have a qstn in a book which have composite no

[@QuickTrixx]

If it is not prime than you have to find inverse using euler theorem I have upload video of that check in my videos where you have to do with phi (n)

[@ravurimanoj9810]

explain theorem and proof

[@MonuKumarSahgal]

plzzz,solve my problem

[@QuickTrixx]

We use inverse while decryption ok .. there are 2 types of inverse possible multiplicative and additive .. euler and fermat (inverse) techniques ... fermat is used when we have prime number example 25mod 3 here 3 is prime so we will solve by fermat little theorem and when there is nonprime number example 25mod 6 we will use inverse using euler theorem and solve both example i have upload my videos 😊 .. now understood

[@noumanahmedkhan8630]

Abey camera tw thk wala lele