SHAMIR’S SECRET SHARING

INTRODUCTION
Consider a team of “N” members created an important document or project and
secured it in a locker having N identical keys , then anyone of them can steal it. if they make
N different keys, then all must be present to open the locker, which is inconvenient.

This problem can be resolved by using Shamir’s Secret Sharing Scheme(SSSS),

in which K out of N keys are mandatory to open the locker.
 This can also be explained using curves, In which the key or password is taken
as Y-coordinate in XY plane and K degree polynomial is plotted and N points are given
as passwords or keys. For example, we need 3 out 5 keys to open a locker then we can
use a 3 degree polynomial and randomly choose 5 points as keys. While opening we
need only 3 keys or points for constructing polynomial.

ACTUAL KEY
Distributed keys
THANK YOU