Shamir's Secret Sharing Algorithm Explained | Step-by-Step Numerical Example

How do you protect a secret so that no single person can steal it, but a group can recover it? Welcome to the world of Shamir’s Secret Sharing (SSS). In this video, we break down Adi Shamir’s ingenious algorithm that uses high-school algebra to provide information-theoretic security. We move past the theory and dive straight into the geometry of secrets, exploring how lines, parabolas, and higher-order curves act as the ultimate "key fragments." What you’ll learn: The Concept: What is Secret Sharing and why do we need (t,n) threshold schemes? The Geometry: How Shamir uses the principle that 2 points define a line, 3 points define a quadratic curve, and k points define a polynomial of degree k−1. The Deep Dive: A step-by-step numerical example using a quadratic curve (degree 2) to split a secret among a group. The Reconstruction: Watch how we use the points to "solve" for the original secret (the y-intercept). Whether you are a computer science student, a developer interested in multi-sig wallets, or a math enthusiast, this guide will give you a functional understanding of one of the most elegant algorithms in cryptography.