Modern Asymmetric Algorithms Intermediate
Shamir's Secret Sharing
Shamir's secret sharing splits a secret into shares so that any k of n shares rebuild it and fewer reveal nothing at all. Learn how a polynomial hides the secret, how Lagrange interpolation recovers it, why k minus one shares give no information, and how GF(256) makes the scheme work on bytes.
20 min read