Secret Sharing - Using The Chinese Remainder Theorem

Using The Chinese Remainder Theorem

The Chinese Remainder Theorem can also be used in secret sharing, for it provides us with a method to uniquely determine a number S modulo k many relatively prime integers, given that . There are two secret sharing schemes that make use of the Chinese Remainder Theorem, Mignotte's and Asmuth-Bloom's Schemes. They are threshold secret sharing schemes, in which the shares are generated by reduction modulo the integers, and the secret is recovered by essentially solving the system of congruences using the Chinese Remainder Theorem.