mathematics

Secret sharing using the Chinese remainder theorem

Secret sharing using the Chinese remainder theorem is a mathematics topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Secret sharing using the Chinese remainder theorem rather than just read about it. In short: Secret sharing consists of recovering a secret S from a set of shares, each containing partial information about the secret. The Chinese remainder theorem (CRT) states that for a given system of simultaneous congruence equations, the solution is unique in some Z/nZ, with n > 0 under some appropriate conditions on the congruences.

Key takeaways

Secret sharing using the Chinese remainder theorem belongs to mathematics; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Secret sharing using the Chinese remainder theorem to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Secret sharing using the Chinese remainder theorem from memory before moving on to harder problems.

Reference excerpt

Secret sharing consists of recovering a secret S from a set of shares, each containing partial information about the secret. The Chinese remainder theorem (CRT) states that for a given system of simultaneous congruence equations, the solution is unique in some Z/nZ, with n > 0 under some appropriate conditions on the congruences. 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.

Secret sharing schemes: several types

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. The first ones are Shamir's threshold secret sharing scheme, which is based on polynomial interpolation in order to find S from a given set of shares, and George Blakley's geometric secret sharing scheme, which uses geometric methods to recover the secret S. Threshold secret sharing schemes based on the CRT are due to Mignotte and Asmuth–Bloom, they use special sequences of integers along with the CRT.

Chinese remainder theorem

Let k ⩾ 2 , m 1 , . . . , m k ⩾ 2 {\displaystyle k\geqslant 2,m_{1},...,m_{k}\geqslant 2} , and b 1 , . . . , b k ∈ Z {\displaystyle b_{1},...,b_{k}\in \mathbf {Z} } . The system of congruences

{ x ≡ b 1 mod m 1 ⋮ x ≡ b k mod m k {\displaystyle {\begin{cases}x\equiv &b_{1}\ {\bmod {\ }}m_{1}\\&\vdots \\x\equiv &b_{k}\ {\bmod {\ }}m_{k}\\\end{cases}}}

has solutions in Z if and only if b i ≡ b j mod ( m i , m j ) {\displaystyle b_{i}\equiv b_{j}{\bmod {(}}m_{i},m_{j})} for all 1 ⩽ i , j ⩽ k {\displaystyle 1\leqslant i,j\leqslant k} , where ( m i , m j ) {\displaystyle (m_{i},m_{j})} denotes the greatest common divisor (GCD) of mi and mj. Furthermore, under these conditions, the system has a unique solution in Z/nZ where n = [ m 1 , . . . , m k ] {\displaystyle n=[m_{1},...,m_{k}]} , which denotes the least common multiple (LCM) of m 1 , . . . , m k {\displaystyle m_{1},...,m_{k}} .

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with Secret sharing using the Chinese remainder theorem

Start with the simplest possible case. Write down what Secret sharing using the Chinese remainder theorem claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In mathematics, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Secret sharing using the Chinese remainder theorem before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Secret sharing using the Chinese remainder theorem ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Secret sharing using the Chinese remainder theorem

In research: Secret sharing using the Chinese remainder theorem appears in mathematics research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Secret sharing using the Chinese remainder theorem in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Secret sharing using the Chinese remainder theorem is common in secondary-school and first-year university syllabi. It links to neighbouring topics Cryptographic algorithms, so understanding it makes those chapters shorter.
In everyday life: Look for Secret sharing using the Chinese remainder theorem outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Secret sharing using the Chinese remainder theorem” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Secret sharing using the Chinese remainder theorem in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Secret sharing using the Chinese remainder theorem means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Secret sharing using the Chinese remainder theorem out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Secret sharing using the Chinese remainder theorem in simple terms?

Why does Secret sharing using the Chinese remainder theorem matter?

Because it connects several mathematics ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Secret sharing using the Chinese remainder theorem?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Secret sharing using the Chinese remainder theorem.