The Chinese Remainder Theorem (Solved Example 1)

preview_player
Показать описание
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.

Music:
Axol x Alex Skrindo - You [NCS Release]

#NetworkSecurityByNeso #Cryptography #NetworkSecurity #ChineseRemainderTheorem
Рекомендации по теме
Комментарии
Автор

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

tasrefulislam
Автор

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!

michaelklikushin
Автор

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

thanasispappas
Автор

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!

akhil_
Автор

05:17
The condition for the existence of a unique solution is not that GCD(m1, m2, m3) must be 1. Rather

GCD(m1, m2) == 1 &&
GCD(m1, m3) == 1 &&
GCD(m2, m3) == 1

In other words LCM(m1, m2, m3) == m1*m2*m3

For eg: given m1=6, m2=10, m3=13. There doesn't exist a unique solution even if the GCD(6, 10, 13) = 1.

This is because
GCD(6, 10) ≠ 1

Or in other words
LCM(6, 10, 13) ≠ 6*10*13

To the educator,
You should study the topic well before making a video on it. If you are not informed enough you should not misguide others. This is not the first time I have noticed misinformation on NESO Academy videos. This channel has Millions of followers, and this particular video has Lakhs of views. It's your responsibility to serve the right information.

professorpoke
Автор

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

TheVinitsaini
Автор

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

juliettetworsey
Автор

Wonderful explanation sir...I have ever seen in this YouTube channel... excellent sir ...

ArivumathiKrishnan
Автор

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

fidgetgadget
Автор

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

kenedykenny
Автор

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.

rajeshprajapati
Автор

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.

allwell
Автор

Thank you sir for an explicit explanation 🙏

seniormedia
Автор

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

Kamlesh_Vlogs
Автор

Simple and clear, thank you very much!

tonanstar
Автор

Thank yoy so much bro.. Very clear and good explanation.. 🙏🙏

kadavulthondan
Автор

Thank you so much sir 🙏 today is my exam 🙏

sauravsharma
Автор

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

direwensik
Автор

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

lennyb.
Автор

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.

abhishek