CastFast1 LOCAL-ONLY
ENEnglish
Engineering Reference · Threshold Backup Mathematics

Shamir Secret Sharing in GF(256) & Passphrase Entropy Math

Updated: 2026-10-297 min readDisaster Recovery

The Master-Key Storage Dilemma: keeping a single backup copy risks permanent loss from physical damage, whereas storing full duplicates multiplies exposure risk. Shamir’s M-of-N threshold scheme mathematically eliminates both failure modes.

1. Why Naive Half-Splitting (6 + 6 Words) Fails

A 12-word passphrase drawn from a 2048-word dictionary (211 choices per word) provides 128 bits of entropy (3.4 × 1038 combinations). Cutting that sheet into two 6-word halves means losing either sheet causes permanent data loss, while exposing one half drops remaining uncertainty to ~62–66 bits.

2. Polynomial Interpolation over Finite Field GF(28)

In our Shamir & Entropy calculator, each UTF-8 byte becomes the constant term S = f(0) of a random degree M−1 polynomial over GF(256) modulo 0x11B. Any M shares uniquely reconstruct f(0) via Lagrange basis polynomials, while M−1 shares leave all 256 byte values equally probable (0 bits disclosed).

Frequently Asked Questions (FAQ)

What is Shamir’s M-of-N Threshold Secret Sharing?
Published by Adi Shamir in 1979, it splits a string into N distinct mathematical shares so that any M shares (e.g., 2 of 3) reconstruct the exact secret, while M−1 shares reveal zero bits of information.
Why shouldn’t I just split a 12-word passphrase into two 6-word halves?
Splitting 12 dictionary words into two 6-word sheets drops remaining combinatoric uncertainty from 128 bits down to ~62–66 bits if one sheet is exposed. With 2-of-3 Shamir sharing, a single exposed share still leaves full 128-bit security intact.
Can I run this tool in Airplane Mode?
Yes. Once this page loads in your browser, you can disconnect Wi-Fi and mobile data, generate and print your vault cards, and close the tab before reconnecting.