Research Article
Unordered Multisecret Sharing Based on Generalized Chinese Remainder Theorem
Table 4
Improved unordered multisecret-sharing algorithm.
| Improved unordered multisecret-sharing algorithm |
| Step 1. Determine and compute by (3) and (2), respectively | Step 2. Determine by (19) and (20) | Step 3. Select two unordered secrets satisfying (21) | Step 4. Determine by (19) and (20) | Step 5. Obtain shares by (26) |
|
|