Slightly more concretely: I can split a secret value s into two parts by randomly choosing a line that has X intercept s, then giving the value of the line at 1 and at 2. Neither of these alone gets me any closer to finding s, but if I know them both, then I can trivially get s.
Also, splitting the parts up directly means you can't do "any t of n is good enough" where t != n and t != 1.
That doesn't have to be true. Rather than splitting an AES key K into substrings, a better approach is to choose n parts such that:
K_1 ^ K_2 ^ ... ^ K_n = K
None of the component K_i will reveal any information about K without knowledge of its peer components.In many applications, though, you want to allow a subset of the parts to reconstruct the key. You might want, say, 8 people to have key shares, but want any 3 of them to be able to reconstruct the key. Shamir's makes this kind of setup easy.
ABCDEFGH
K1 K2 K3 K4 K1 K2 K3 K4
K1: AE K2: BF
and so on.. ?
2. You get to pick how many parts are needed to reconstruct, e.g. three of seven parts required.