Shamir Secret Sharing
Split sensitive secrets into N cryptographic shares requiring a threshold of K shares to reconstruct using information-theoretically secure Galois Field GF(256) mathematics.
Polynomial Threshold Scheme
f(x) over GF(256) • Threshold: 3 of 5 Shares
Secret Payload
GF(256) PolynomialShamir Threshold Cryptography
Adi Shamir's (1979) scheme splits a secret into N parts such that any K parts can easily reconstruct the secret, but K - 1 parts reveal strictly zero information.
- Information-Theoretic Security: Unbreakable even with infinite computational power.
- Finite Galois Field GF(256): Operates byte-by-byte without arbitrary precision overhead or number size bloat.
- Lagrange Interpolation: Polynomial evaluation recovers constant term f(0) = Secret.
Information-Theoretically Secure Threshold Cryptography
Shamir's Secret Sharing (SSS) is an information-theoretically secure cryptographic threshold scheme formulated by cryptographer Adi Shamir in 1979. It enables a secret value (such as a master password, cryptocurrency seed phrase, or private key) to be divided into N distinct shares such that any K shares (the threshold) can reconstruct the original secret, while any K-1 or fewer shares reveal absolute zero information.
This implementation executes strictly client-side over the Galois Field GF(256) with the standard irreducible reduction polynomial x^8 + x^4 + x^3 + x + 1. For each byte of the secret payload, a random polynomial of degree K-1 is generated using the browser's cryptographically secure pseudo-random number generator (crypto.getRandomValues). The shares are produced by evaluating this polynomial at distinct non-zero coordinates.
During reconstruction, the original secret is recovered using Lagrange polynomial interpolation evaluated at coordinate x=0. Because the security guarantee is mathematical rather than computational, even an adversary with infinite computing power cannot deduce any part of the secret without possessing at least the threshold number of shares.
Core Tool Capabilities
- Information-Theoretic Security: Possessing K-1 shares yields mathematically zero knowledge regarding the original secret text.
- Galois Field GF(256) Arithmetic: Operates over finite field GF(256) using exponent and logarithm lookup tables for exact byte-level precision.
- Customizable Threshold (K) & Total Shares (N): Supports any threshold K and total share count N where 1 <= K <= N <= 255.
- Lagrange Polynomial Reconstruction: Reconstructs original secrets from any valid combination of K or more shares using Lagrange basis polynomials.
Local Browser Privacy
Your files are processed locally on your device. Files are not uploaded, transmitted, or stored on remote servers.
Once the page has loaded, you can disconnect your network connection and continue using this tool offline.
Target Use Cases
- • Cryptocurrency Recovery Seed Custody
- • Break-Glass Master Password Escrow
- • Root Certificate Authority Key Splitting
- • Cryptographic Education & Research
Technical Specifications & Platform Limits
Standard 8-bit finite field arithmetic.
Cryptographically secure polynomial coefficients.
Standard copyable coordinate-value serialization.
Zero external transmission of secrets or shares.
Step-by-Step Workflow
Select Operation Mode
Choose Split Secret into Shares to divide a secret, or Reconstruct Secret from Shares to assemble recovered shares.
Configure Threshold K and Total Shares N
Define how many custodians will receive shares (N) and how many custodians are required to assemble for recovery (K).
Generate and Distribute Shares
Click Generate Shares. Copy individual shares or use Copy All Shares to safely distribute to distinct stakeholders.
Reconstruct Secret with K Shares
When recovering, paste at least K valid shares into the reconstruction workbench to restore the exact secret text.
Practical Real-World Use Cases
Cryptocurrency Recovery Seed Custody
Splitting a 24-word hardware wallet seed phrase among family members or safety deposit boxes requiring 3 of 5 to spend.
Break-Glass Master Password Escrow
Distributing corporate disaster recovery credentials among executive trustees so no single person can act alone.
Root Certificate Authority Key Splitting
Dividing root CA revocation keys among geographically distributed security officers requiring multi-party authorization.
Cryptographic Education & Research
Demonstrating finite field arithmetic, polynomial interpolation, and threshold cryptography in cybersecurity courses.
Frequently Asked Questions
- What happens if someone gets K-1 shares?
- Nothing. In Shamir's Secret Sharing, possessing K-1 shares provides mathematically zero information about the secret. Every possible byte value remains equally probable, providing information-theoretic security.
- Can I use shares generated by other tools with this calculator?
- Shares generated by this tool use the standard GF(256) polynomial format serialized as 'share-{index}-{hexPayload}'. Tools using identical GF(256) polynomials can interoperate, but non-standard implementations with different field parameters will not match.
- Are my secrets or shares stored on the server?
- Never. All polynomial calculations, random coefficient generations, and Lagrange interpolations take place purely in your browser's local memory using Web Crypto CSPRNG.
- What happens if a share is altered or corrupt?
- If a share byte is corrupted, polynomial reconstruction will fail or produce an invalid character string. All shares must be kept intact with their coordinate indices.
- Can I run this tool completely offline?
- Yes. The tool requires zero network access. You can save the webpage or use it in airplane mode for air-gapped cryptographic operations.
Share this tool
Help others discover this utility. No login or registration required.
Master this tool with Guides & Articles
Learn the workflows, common mistakes, and advanced techniques behind Shamir Secret Sharing - Threshold Cryptography over GF(256) with our deep-dive educational content.