Split secrets into multiple shares and reconstruct them securely. Perfect for crypto wallet keys, passwords, and multi-person authorization.
Threshold CryptographyTotal number of shares to generate
Minimum shares needed to recover
Shamir's Secret Sharing (SSS) is a cryptographic algorithm created by Adi Shamir in 1979. It allows you to split a secret into multiple parts (shares) in such a way that a minimum number of shares (threshold) are required to reconstruct the original secret.
With k-of-n threshold, any k shares can recover the secret, but k-1 shares reveal nothing.
Mathematically proven to be unconditionally secure, not dependent on computational assumptions.
Perfect for multi-person authorization, disaster recovery, and key escrow systems.
Securely distribute your seed phrase among trusted parties or locations.
Security Note: All processing happens in your browser. Your secret is never transmitted to any server. For maximum security, use this tool offline.
The algorithm uses polynomial interpolation in a finite field. The secret is the constant term of a random polynomial, and each share is a point on that polynomial.
// Example: 3-of-5 Shamir Secret Sharing
// Secret: "MyPassword123"
// Generated shares:
Share 1: 801a2b3c4d5e6f7...
Share 2: 802a3b4c5d6e7f8...
Share 3: 803a4b5c6d7e8f9...
Share 4: 804a5b6c7d8e9fa...
Share 5: 805a6b7c8d9eafb...
// Any 3 shares can recover "MyPassword123"
// Any 2 shares reveal NOTHING about the secret