Shamir Secret Sharing
Split a secret into several shares so that any chosen number of them can rebuild it, while fewer reveal nothing. Use it to spread a recovery key or password across people or places, then combine enough shares to get the secret back.
Frequently asked questions
How does Shamir's secret sharing work?
Each byte of the secret becomes the constant of a random polynomial over the finite field GF(256). Every share is a point on these polynomials. Any threshold number of points determines the polynomials and so the secret, while fewer points leave every secret equally likely.
How do I choose shares and threshold?
Shares is how many pieces to create, threshold how many are needed to recover. Three of five is a common choice: you can lose two shares and still recover, and no two people can recover alone.
What does a share look like?
threshold-index-hex, for example 3-2-9f04a1. The first number is the threshold, the second the share number and the rest the share data. Keep the whole line; the numbers are needed to combine.
How do I recover the secret?
Choose combine and paste at least the threshold number of shares, one per line, in any order. Extra shares are ignored.
Can I combine shares made by other tools?
Only shares made by this tool. Shamir implementations differ in field polynomial, encoding and share format, so they are not interchangeable.
Is my secret stored?
No. It is split or recombined for this request only, and the input is not echoed in the result. The secret can be up to 1,024 bytes.