Shamir's Secret Sharing

Shamir's Secret Sharing scheme, which is also known as (k,n) threshold is implemented in this file.

Shamir's Secret Sharing is an algorithm in cryptography. It is a form of secret sharing, where a secret is divided into parts, giving each participant its own unique part, where some of the parts or all of them are needed in order to reconstruct the secret.
Counting on all participants to combine together the secret might be impractical, and therefore we sometimes use the threshold scheme where any k of the parts are sufficient to reconstruct the original secret.

Three M files are contained in the zip file.
1. Demo.m: a demo of showing how Shamir's scheme sharing secret among people
2. ShamirSharing.m : the function to share secret info
3. ShamirReconstruction.m: the function to reconstruct info from parts

Any problems please send me email.