Shamir Secret Sharing (GF(256))

In split mode, enter a secret, the number of shares n and the threshold k. In combine mode, paste at least k shares to recover the secret.

Use the tool

Why this tool exists

Some secrets are too important to keep in one place and too dangerous to hand to one person: a recovery passphrase, an encryption key, a vault unseal key. Shamir's scheme splits the secret into shares so that any k of them recover it, while fewer than k reveal nothing about it. A typical use is three of five: five trustees each hold one share, and any three can recover the secret. This tool works byte by byte over GF(256), takes its random coefficients from the browser's secure generator, and checks its own output by recombining before showing it. Shares look like 3-1-abcdef.... Handle real secrets with care: this is an educational, unaudited tool, and the page that sees the secret must be trustworthy.

How to use it

  1. Choose split or combine.
  2. To split, enter the secret, the number of shares and the threshold; to combine, paste one share per line.
  3. Copy the shares and give each to a different person, or read the recovered secret.

Frequently asked questions

What do the share names mean?

A share looks like k-x-hex: k is the threshold needed, x is the share number from 1 to 255 and the hex part is the data. All shares must be kept intact.

How many shares do I need to recover the secret?

At least k of the n shares, any combination. With fewer than k shares, every possible secret is equally likely, so they reveal nothing.

Is it safe for real secrets?

Treat it with care. It runs in your browser and nothing is uploaded, but the code is hand-written and unaudited. For high-value secrets, use a reviewed tool offline.

What are the limits?

Between 2 and 255 shares, a threshold of at least 2 and no more than n, and a non-empty secret. The secret can be text or hex.