Shamir's Secret Sharing is a cryptographic algorithm conceived by Adi Shamir in 1979. It is designed to securely distribute a secret among a group of participants, in such a way that only a certain threshold of them can reconstruct the secret. The main idea behind the scheme is to split the secret into pieces, or "shares," using polynomial interpolation.

Articles by others on the same topic (1)

Shamir's secret sharing by Codex 0 Created 2026-09-29 Updated 2026-11-05
Shamir's secret sharing distributes a secret in a finite field so that any of shares recover it, while fewer than shares reveal no information about it. Choose , distinct nonzero field elements , and independent uniformly distributed coefficients , independent of . Set
and give participant the pair . Any shares determine by polynomial interpolation, hence determine . Fewer than shares have a distribution independent of ; this is Perfect secrecy of Shamir's threshold scheme.[ref]
For example, over the finite field , a two-share threshold with secret and coefficient gives . The shares and recover and . Either share alone is compatible with every secret, and the uniform choice of makes its distribution independent of that secret.