Shamir's Secret Sharing (SSS) Simulator
Shamir's Secret Sharing (SSS) Simulator: Constructs a random degree-(k-1) polynomial over Galois Field GF(256) and evaluates points (x, f(x)).
About this shamir's secret sharing (sss) simulator
Constructs a random degree-(k-1) polynomial over Galois Field GF(256) and evaluates points (x, f(x)) Runs entirely in-memory using Web Crypto primitives to keep sensitive tokens, certificates, and cryptographic keys secure from third-party interception.
Encoding & cryptographic principles
Performs symmetric encryption and asymmetric public-key operations adhering to NIST FIPS 197 (AES), RFC 7539 (ChaCha20-Poly1305), RFC 8032 (Ed25519 Digital Signatures), and PKCS#1 / RFC 3447 (RSA). AES-GCM provides authenticated symmetric encryption using 128-bit or 256-bit keys and 96-bit initialization vectors (IVs) to ensure confidentiality and cryptographic authentication. Key derivation employs PBKDF2 (RFC 2898) with HMAC-SHA256 and configurable salt iterations to thwart brute-force dictionary attacks.
Worked verification example
Scenario: Reconstruct a fixed demonstration secret from three supplied GF(256) shares.
Sample input:
Processing: Decodes each supplied share and interpolates its bytes at x=0 in GF(256); this combine example does not split or generate new shares.
Illustrative output:
Security parameters & input constraints
Split clamps shares and threshold to 2–16 and threshold to share count. The share strings do not carry their original threshold; combine checks indexes and lengths but cannot tell whether enough shares were supplied, so too few can yield incorrect text or an error. Keep shares secret and verify recovery yourself. Noninteger or nonfinite shares/threshold and unknown operations are rejected.
Cryptographic digests, encoded strings, and signatures generated by Shamir's Secret Sharing (SSS) Simulator should be verified against target authentication systems before production use.
Client-side Web Crypto boundary
Key derivation, hashing, and encoding in Shamir's Secret Sharing (SSS) Simulator execute in local memory using Web Crypto APIs without remote socket transmission.
Cryptographic specifications & RFC standards
Technical specifications and cryptographic RFC standards governing algorithms and key representations:
Shamir's Secret Sharing (SSS) Simulator verification · Audit standards
How to use it
- Enter JSON with secret, shares and threshold to split; defaults are five shares with threshold three.
- Generate 2–16 random GF(256) shares encoded as index-Base64 strings.
- To recover, enter operation combine and at least two original share strings; read the UTF-8 secret.
Frequently asked questions
What does Shamir Secret Sharing return?+
It parses JSON secret, shares and threshold and returns generated share material for the requested split.
What does a 5-share, threshold-3 example return?+
Provide a secret with shares 5 and threshold 3. The result contains five generated shares; it is not an identity, transport, or secret-storage system.
Does one share reveal the secret?+
The intended threshold property requires enough valid shares; this page result is not an identity, transport, or storage system.
What inputs are required?+
Use a JSON object with secret text and share/threshold counts; malformed values follow the page error path.