Research Article
Unordered Multisecret Sharing Based on Generalized Chinese Remainder Theorem
Table 5
Improved unordered multisecret recovery algorithm.
| | Improved unordered multisecret recovery algorithm |
| | Step 1. For each share , compute | | Step 2. Compute , , and satisfying | | Step 3. Compute | | Step 4. Let , then compute | | Step 5. Obtain two solutions by solving | | Step 6. Obtain the two secrets by |
|
|