e99 Online Shopping Mall

 Help Home  - Theorems And Conjectures - Chinese Remainder Theorem (Books)

 1-6 of 6

click price to see details     click image to enlarge     click link to go to the store

 1. Chinese Remainder Theorem: Applications
 2. Secret Sharing Using the Chinese
 3. Remainder: Natural Number, Real
 4. A hierarchical single-key-lock
 \$57.945. Fundamental Number Theory with
 \$82.956. Fundamental Number Theory with

 2. Secret Sharing Using the Chinese Remainder Theorem: Secret Sharing, Chinese Remainder Theorem, Threshold Cryptosystem, Cardinality, Access Structure, Shamir's ... Polynomial Interpolation, George Blakley Paperback: 80 Pages (2010-02-11) list price: US\$47.00Isbn: 6130391617Canada | United Kingdom | Germany | France | Japan Editorial ReviewProduct DescriptionHigh Quality Content by WIKIPEDIA articles! Secret sharing consists of recovering a secret S from a set of shares, each containing partial information about the secret. Secret sharing can thus use the CRT to produce the shares presented in the congruence equations and the secret could be recovered by solving the system of congruences to get the unique solution, which will be the secret to recover. There are several types of secret sharing schemes. The most basic types are the so-called threshold schemes, where only the cardinality of the set of shares matters. In other words, given a secret S, and n shares, any set of t shares is a set with the smallest cardinality from which the secret can be recovered, in the sense that any set of t-1 shares is not enough to give S. This is known as a threshold access structure. We call such schemes (t,n) threshold secret sharing schemes, or t-out-of-n scheme. Threshold secret sharing schemes differ from one another by the method of generating the shares, starting from a certain secret. ... Read more

 3. Remainder: Natural Number, Real Number Modulo Operation, Chinese Remainder Theorem, Division Algorithm, Euclidean Algorithm Paperback: 96 Pages (2010-01-11) list price: US\$49.00Isbn: 6130339887Canada | United Kingdom | Germany | France | Japan Editorial ReviewProduct DescriptionHigh Quality Content by WIKIPEDIA articles! In arithmetic, when the result of the division of two integers cannot be expressed with an integer quotient, the remainder is the amount "left over." If a and d are natural numbers, with d non-zero, it can be proven that there exist unique integers q and r, such that a = qd + r and 0 ? r < d. The number q is called the quotient, while r is called the remainder. The division algorithm provides a proof of this result and also an algorithm describing how to calculate the remainder. ... Read more

 4. A hierarchical single-key-lock access control using the Chinese remainder theorem (OSU-CS-TR)by Kim Sin Lee Unknown Binding: Pages (1994) Asin: B0006PAYCICanada | United Kingdom | Germany | France | Japan