The Chinese Remainder Theorem (Solved Example 1)

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

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

50% 1

Network Security: The Chinese Remainder Theorem (Solved Example 1)
Topics discussed:
1) Chinese Remainder Theorem (CRT) statement and explanation of all the fields involved in the theorem.
2) Explanation of working of CRT with different moduli that are relatively prime.
3) Solved Example 1 on finding the common variable ‘X’ using CRT with 3 different congruent equations.
4) Explanation on how to verify the final result obtained.
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 #ChineseRemainderTheorem

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

31 июл 2024

Ссылка:

Скачать:

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

Добавить в:

Мой плейлист

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

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

@michaelklikushin6045 Год назад

Incredible video. I had multiple moments where I had a revelation and info from my class and lab connected thanks to your insight. Insanely well done!

@tasrefulislam2873 11 месяцев назад

Undoubtedly this is the most valuable lecture I have ever seen in you tube which is enough to understand.

@TheVinitsaini Год назад

Thank you, I think this is the best and easiest possible explanation of CRT.

@thanasispappas62 Год назад

One of the best explanations ive seen on the internet, insanely well done

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

thank you for showing, clear and easy to follow, thumbs up and blessings to you

@seniormedia5549 Год назад

Thank you sir for an explicit explanation 🙏

@tonanstar Год назад

Simple and clear, thank you very much!

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

Thank you so much for breaking all of the steps down in a way that is easy to follow!

@karthikkcp2614 Год назад

Tu ukg mein h kya?

@xiaoqingtian6542 Год назад

Finally, I understand. Thank you for your work.

@AaaAaa-yb2nb 7 месяцев назад

Wow, thank you so much, very easy to understand… thought it was super complicated but now I think it’s quite easy… thanks again 🤗

@sentamiljayaraj5911 Год назад

Thank you so much sir.very easy to understand ,very good explaination .

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

Excellent explanation 👌, it was so detail

@earlythelate8005 Год назад

Wow Thank you so much sir . This solution really help me in solving Chinese Remainder Theorem

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

It is just wonderful thanks so much for such assistance

@amruthahs5907 Год назад

Thank you for this wonderful explanation 👏 🙏 😊

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

Clear explanation Thank you sir☺️

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

Thank you, very good explanation

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

Best CRT video I have ever watched

@kenedykenny8146 Год назад

The explanation looks veerrryy ....easy 👍. Thank you

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

God bless you for making a clear demonstration

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

Thank you so much!!! Really helpful!

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

A clear explanation 💯💯

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

thanku sir for describing very deeply i fully understand what is chainess reminder theorem thanku so much sir

@direwensik2481 Год назад

thanks a lot, sir ... i had to spend over 2 hours to understand this theorem

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

U r really awesome sir ❤️❤️ super explaination

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

Thanks for the amazing explanation

@Mahmoud-li2xn 2 года назад

Great Explanation

@lennyb.9616 Год назад

Thank you that was very clear ! (way clearer that chatGPT's explanations)

@Rennnn-mo6ih 7 месяцев назад

Thank you so much sir understood very well

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

Thank you so much sir 👍❤️

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

From the heart thank u very much

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

thank you for the video!🙏

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

Thanks sir I clear understand the lesson

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

It's amazing , thank you!

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

aitu?

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

If my message is encrypted with e =3 and n1=629, n2=2173, n3=1159 as c1,c2and c3 what would be the original message? Would this work for that?

@mdsahilkhan5535 Год назад

sir but we are computing multiplicative inverse with extended euclidean algo then X's value is 96 (X=96). please reply

@lalintuguic561 Год назад

Very nice explanation

@pemudahijrah2454 Год назад

Great explanation

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

Thank u bro 💯 for help me 😍😍😍👊🙏

@atulgupta-g 7 месяцев назад

Thank you so much😄

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

Going through a breakup rn... I couldn't Focus on my studies and it's the last min for me, tomorrow is my exam,this helps a lot....thankyou God bless you!

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

Thank you very much Sir

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

I hope someone can help me please. I have these equations, only 2 sets at a time, but there is an additional constraint, example ( x > 70 ). Any advice on this please?

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

Thank you so much 💞

@aqsanoor8162 Год назад

Very Good ...☺️...your lecture is very helpful for all students ....Thank u soo much .....Allah ap ko jazy khair ata farmy ...ameen

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

I am getting wrong answer for finding multiplicative inverse of 35 by using extended Euclidean algorithm .Please post the solution for multiplicative inverse of 35.

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

Thank you so much sir 🙏 today is my exam 🙏

@sumatigouri9023 Год назад

Thank you sir

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

Thank you very much

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

What if one of the system is X = y mod8 ?? How can we solve that?

@chandbeautifulpoetryands-cx4rk 6 месяцев назад

Good 👍 teaching style

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

I got Inverses of M1 and M3 as 12 and 5 using EEA. I tried again and again, still got them as MI of M1 and M3.

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

to find M1, in EEA , use 3 as A and 35 as B.. Then u should get M.I for M1 as 2

@pragathiyp5622 Год назад

@@akilanss2770 why like that though ? how do we know we have to take A as 3 and 35 as B

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

THX BRO VERY MUCH

@RajeshKumar-jr1hj 2 года назад

Really great

@outofyourmind1406 Год назад

thank you you are the best

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

Very good 👍👍👍

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

thank you so much

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

if i get negative value using eea for m inverse what to do?

@khumbokaunda7402 Год назад

Thank you🔥

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

really clear explanation but where does this theorem come from?

@ANANDKUMARKASHYAP-ue8dg Год назад

YES SIR ALL CLEAR ALOGARITHMSA THAT YOU HAVE MAKE

@allwell8570 Год назад

If you are following neso's video about extended euclidean algorithm, while calculating modulo multiplicative inverse, assign a=m1, b= M1, t1=0, t2=1.

@YeniyanSemman-xh2cj Год назад

his method not working for 35 mod 3?

@k-AsharKhalil Год назад

@@YeniyanSemman-xh2cj yes. not working

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

this is helpful. I was confused when I got 12 for M1^-1 and his answer was 2. Now I got 2 when I did as you suggested. thank you

@kennethha8173 Год назад

I FINALLY UNDERSTAND thanks so much

@vishali3664 Год назад

Previous vdo link to deal with large number?

@turbokaivuri8390 Год назад

Since x could also be 128, wouldnt the answer be x = 23(mod 105)

@Akashyadav-re3vk Год назад

Thanku Sir 🙏❤️😇

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

Thank you

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

Thanks 😊 🙏

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

Thanks

@talhaihsan Год назад

Perfect 💜

@ranjithrsr3859 Год назад

07/03/2023 Tuesday I'll be watching you

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

Sir please upload RSA algorithm..

@abhishek3396 Год назад

Today was my exam and 10 marks Question was that with non relative pairs of m1,m2 ....and i was not able to do that bcoz that concept you didn't teach plz provide complete portion.

@Randomguy-zy3bc Год назад

which clg bro

@abhishek3396 Год назад

@@Randomguy-zy3bc LPU

@robinhoodpandey3509 Год назад

thank u sir

@meghana.s.s9749 2 года назад

Wonderful ,tqsm 🥰

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

Thanks Boss

@rcyadav7493 Год назад

THANKS

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

Tanks to you❤

@alexanderspeigle5062 6 дней назад

Where can I find a proof of the formula to find X? I've been stuck on that question for some time now.

@kumar-bi2ef 10 месяцев назад

You explained clearly akka... Keep putting new vedios.. Keep going up.. Continue rocking.. Put more vedios.. Continue I will always support you akka... Very soon you will reach crore subscribers... 🎉 All the best...

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

mind blowing

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

Sir to find M3 inverse u have explained 15*1mod 7 so the remainder will be 7 oly , instead y can’t we take 15/7 7*2=14 so we can get 1 as remainder u have taken 1 as M3inverse y can’t we take M3inverse as 2??? Pls suggest