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.
Read more about this topic: Secret Sharing
Famous quotes containing the words remainder and/or theorem:
“Most personal correspondence of today consists of letters the first half of which are given over to an indexed statement of why the writer hasn’t written before, followed by one paragraph of small talk, with the remainder devoted to reasons why it is imperative that the letter be brought to a close.”
—Robert Benchley (1889–1945)
“To insure the adoration of a theorem for any length of time, faith is not enough, a police force is needed as well.”
—Albert Camus (1913–1960)