Split master keys into escrow shares for disaster recovery. Assign custodians and track share distribution.
This tool escrows a master key by splitting it into n shares and requiring any k of them to reconstruct it, so no single custodian ever holds the whole key. You name the custodians, each receives a separate share, and the distribution record shows who holds what and how many shares are still needed. The split and any reconstruction happen entirely in your browser; key material is never sent anywhere. The thing people most often get wrong is the threshold: with a 3-of-5 split, two lost shares are survivable, but losing a third destroys the key permanently.
The master key becomes the constant term of a random polynomial of degree k-1, and each of the n shares is a point on that polynomial. Any k points define the polynomial uniquely, so any k custodians together can recover the key, while k-1 or fewer shares carry no usable information: threshold splitting is all-or-nothing, not proportional.
To recover the key you enter shares until you have k of them, and the polynomial is rebuilt so the key can be read from it. Each share can be labeled with its custodian's name and exported on its own, and the distribution view shows which shares are issued, who holds them, and how many more are needed to reach the threshold.
No. Below the threshold, shares contain no usable information about the key: mathematically, any k-1 shares are consistent with any possible secret. You either present k shares and reconstruct the whole key, or you learn nothing. Treat every share as sensitive as the key itself, and read the threshold as the answer to how many custodians can be lost or hostile before recovery still succeeds.
As long as at least k shares remain, reconstruction still works; losing one share of a 3-of-5 split is survivable. What is not survivable is falling below k, because no amount of computing recovers a secret from too few shares. Re-split the key into a fresh share set early, before losses accumulate, and keep issued shares comfortably above the threshold.
The behavioral notes were checked against the browser implementation. Standards and primary references below define the relevant format, formula, or platform behavior.
Generate strong, random passwords with customizable length, character sets, and complexity requirements.
Analyze password strength with entropy scoring, crack-time estimates, and improvement suggestions.
Create cryptographically random strings for API keys, tokens, salts, and unique identifiers.
Create QR codes for URLs, text, Wi-Fi credentials, vCards, and more with customizable size and colors.
Scan and decode QR codes from uploaded images or your device camera to extract embedded data.
Compute MD5, SHA-1, SHA-256, and SHA-512 checksums to verify file integrity and detect tampering.