Home▸Cryptography▸Shamir's Secret Sharing: Splitting a Secret So No Single Person Can Reconstruct It Alone

🧩 Shamir's Secret Sharing: Splitting a Secret So No Single Person Can Reconstruct It Alone

Explore Adi Shamir's 1979 secret-sharing scheme, where a polynomial curve splits a secret into shares so any threshold group can reconstruct it but any smaller group learns nothing at all.

Cryptography3DModerate60 FPS

This simulator demonstrates how Shamir's Secret Sharing splits a secret into shares using a random polynomial, showing visually how a threshold number of points pins down the curve while fewer points leave the secret completely undetermined.

🔬 What It Demonstrates

🎮 How to Use

Set a secret value and a threshold, generate the resulting share points on the polynomial curve, then try combining different numbers of shares to see when the secret is successfully reconstructed and when it stays hidden.

💡 Did You Know?

Did you know that with fewer than the threshold number of shares, literally every possible secret value remains equally consistent with the shares you hold, so no amount of computing power could narrow down the answer?

⚙ Under the hood

Explore Adi Shamir's 1979 secret-sharing scheme, where a polynomial curve splits a secret into shares so any threshold group can reconstruct it but any smaller group learns nothing at all.

cryptographysecret sharingshamirpolynomial interpolationthreshold schemekey managementinformation theorysecurity

3D · Three.js / WebGL renderer · 60 FPS target · runs fully client-side, no install