Cryptographically split master passwords, recovery seed phrases, and confidential keys into N threshold shares over Galois Field GF(256) where any K shares reconstruct the secret.
Military-grade client-side file and document encryption using AES-256-GCM and PBKDF2 with 100,000 SHA-256 iterations. Encrypt photos, PDFs, and text into private .vedvault containers.
Compute high-speed SHA-256, SHA-512, SHA-384, SHA-1, and MD5 hashes and HMAC signatures for text or files up to 2GB using the browser's native Web Crypto API with instant checksum verification.
Decode and inspect RFC 7519 JSON Web Tokens (JWT) client-side in RAM. Live expiration countdown, header/payload JSON formatting, and signature verification with zero server upload.
Generate instant, customizable UPI payment QR codes compliant with official NPCI specs. Set custom amounts, payee VPA, transaction notes, and export high-res PNG printables locally.
Automatically detect and mask API keys (OpenAI, AWS, GitHub, Stripe), tokens, database URIs, passwords, emails, phone numbers, and PII before submitting prompts to ChatGPT, Claude, or Gemini.
Hide and extract encrypted confidential text, passwords, and cryptocurrency recovery seeds inside lossless image pixels using Least Significant Bit (LSB) encoding and AES-256-GCM encryption in browser RAM.
Lagrange Polynomial Interpolation, Master Key Recovery, Zero-Knowledge Sharding & Crypto Protection
Invented by cryptographer Adi Shamir in 1979, Shamir's Secret Sharing is an algorithm that splits a confidential secret S into N distinct pieces (shares) such that:
K (threshold) shares can reconstruct the original secret.K - 1 or fewer shares reveals strictly zero mathematical information about the secret (information-theoretic security).The algorithm constructs a random polynomial of degree k - 1 where the constant term a_0 is the secret byte:
f(x) = a0 + a1x + a2x^2 + ... + a{k-1}*x^{k-1}.
To prevent precision loss from floating-point arithmetic, all calculations are executed over Galois Field GF(256) with irreducible polynomial x^8 + x^4 + x^3 + x + 1 (0x11b).
Reconstruction uses Lagrange Polynomial Interpolation:
f(0) = \sum{i=1}^{k} yi \prod{j \neq i} \frac{xj}{xj \oplus xi}.
SSS is ideal for:
How Shamir's Secret Sharing (M-of-N Key Splitter) processes files securely inside your device memory
Every byte of your file is loaded directly into browser ArrayBuffers. Data is processed in volatile sandbox memory and flushed immediately when you close or refresh this tab.
Calculations and image matrix transformations leverage client-side GPU / Canvas2D engines for zero-latency output without server queuing or rate limits.
Generated files strictly follow international ISO specifications (JPEG JFIF, PDF 1.7, Web Crypto API) to guarantee acceptance on all official portals and banking systems.
Quick 4-step guide for instant results
Select Split Secret to shard a confidential passkey, or Combine Shares to reconstruct a previously split secret.
Set the total number of shares to generate (e.g. 5) and the minimum threshold required to reconstruct (e.g. 3-of-5).
Click Generate Shares. The engine samples cryptographically secure random coefficients and outputs hexadecimal shares.
Save each share independently. Distribute them across trusted geographic locations or separate offline USB drives.
Common questions and verified answers about Shamir's Secret Sharing (M-of-N Key Splitter)