News for hackers. Stuff that matters.
Re:Shamir's Secret Sharing Scheme (2005) by sdevlin on Wednesday July 02, 2014 @10:31PM (#7981157)
> If you split into multiple parts, each part of the key is useful: it lets you reduce your search space by however many bits of the key you have.

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.
Re:Shamir's Secret Sharing Scheme (2005) by tzs on Thursday July 03, 2014 @12:22AM (#7981423)
That's fine if you are willing to require all n parts to be available to reconstruct the key.

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.

Re:Shamir's Secret Sharing Scheme (2005) by ryan-c on Wednesday July 02, 2014 @10:41PM (#7981184)
I wouldn't call that "splitting". This is how you do shamir's scheme over GF(2^n) when the number shares equals the threshold.
Re:Shamir's Secret Sharing Scheme (2005) by Mandatum on Wednesday July 02, 2014 @10:44PM (#7981194)
KEY:

ABCDEFGH

K1 K2 K3 K4 K1 K2 K3 K4

K1: AE K2: BF

and so on.. ?