Report

Help us improve this tool

Shamir Secret Sharing

Split secrets into N shares with threshold K and reconstruct using Shamir polynomial sharing in your browser.

O M T

Shamir secret sharing in the browser

Adi Shamir's threshold scheme splits a secret into N shares so any K shares reconstruct the secret, but fewer than K reveal nothing (information-theoretic threshold in the ideal model). This tool uses polynomial interpolation over a 127-bit prime field, entirely client-side.

Split and combine

  1. Choose split mode, set total shares N and threshold K (2 ≤ K ≤ N).
  2. Enter the secret and distribute share blocks to custodians.
  3. In combine mode, paste at least K share blocks separated by blank lines to recover the secret.

For transport encryption of shares, combine with RSA Sign Verify or your organization's key-management process.

Frequently Asked Questions

Is the secret uploaded?

No. Splitting and Lagrange interpolation run in your browser with Web Crypto randomness.

What share format is used?

Each share block lists lines index:byteLength:hex per secret chunk. Keep blocks intact when copying.

Is this a substitute for HSMs or MPC?

No. Use this for education, drills, and offline ceremonies; production key ceremonies need audited tooling and policy.