Secret Sharing by CRT (Menu Individual Procedures \ Chinese Remainder Theorem Applications)

By choosing the dialog window Secret Sharing by CRT  you will find an interactive visualisation of a "Secret-Sharing-Threshold-Scheme".

It is a concept for distributing keys to an arbitrary number (7 in this example) of parties.

Characteristic for this distribution is, that a (before specified) smaller number k < n of keys can rebuild the secret.

In fact, you're able to generate a secret for 5 parties and have it rebuilt by any three of these five.