Shamir Secret Sharing
Split a secret into N shares where any K shares can reconstruct the original. Uses Shamir's Secret Sharing over GF(256). Everything runs locally.
About
This implements Shamir's Secret Sharing over GF(256). Each byte of the secret is split independently using random polynomial coefficients. The share format is x-hex where x is the share index (1-255) and hex is the evaluated polynomial for each byte.
Related tools
Generate strong passwords locally in your browser.
Generate secure passphrases from a word list with entropy calculation, locally in your browser.
Estimate password strength locally; no network requests.
Calculate password and passphrase entropy in bits with time-to-crack estimates.
Generate MD5/SHA256/SHA512 hashes in-browser.
Generate HMAC (SHA-256/512) using WebCrypto.