Shamir's Secret Sharing

Split secrets into shares — any threshold can reconstruct the original. Cryptographically secure using GF(256) arithmetic.

Secret

0 characters0 bytes

Configuration

Threshold (K)

2 (minimum)5 (all required)

Total Shares (N)

3 (threshold)20 (maximum)

3-of-5 scheme: Any 3 shares can recover the secret. 2 shares can be lost without data loss.

Shamir's Secret Sharing uses polynomial interpolation over GF(256). Each share reveals zero information about the secret. Cryptographically secure — nothing leaves your device.

No shares generated yet

Enter a secret and configure the scheme to generate shares

How It Works

Perfect Secrecy

Any k−1 shares reveal zero information about the secret. Information-theoretically secure.

Polynomial Math

Uses polynomial interpolation over GF(256) — a finite field with 256 elements.

Client-Side Only

All cryptographic operations happen in your browser. No data is transmitted to any server.