Supposedly used by ancient generals to count the number of soldiers in an army, this theorem states that there exists a solution to a set congruence relations if the moduli are all positive integers and are pairwise coprime.
Cryptographic applications of this theorem include the Mignotte and Asmuth-Bloom secret sharing schemes. Godel derived his Beta function using this theorem. Along with Euler's Theorem, the Pohlig-Hellman algorithm primarily uses this statement in order to compute discrete logarithms. It can be used to prove that the (*) totient function preserves products. An isomorphism between a quotient ring and a product of quotient rings can be shown to exist using an extension of this theorem. Supposedly used by ancient generals to count the number of soldiers in an army, this theorem states that there exists a solution to a set congruence relations if the moduli are all positive integers and are pairwise coprime. For 10 points, name this theorem which was supposedly first proposed in the third century C.E. by Sun Tzu.
Cryptographic applications of this theorem include the Mignotte and Asmuth-Bloom secret sharing schemes.
Chinese Remainder Theorem [prompt on CRT]