4 ms·

I've always wondered about this, and one of the ideas I've been playing with my head is the distributing the keys between a few people, and if something were to

I've always wondered about this, and one of the ideas I've been playing with my head is the distributing the keys between a few people, and if something were to happen, they can combine them to unlock my secret (all the keys must be present) SECRET xor KEY_A xor KEY_B xor KEY_C xor KEY_D = PUBLIC This is kind of lame, but the same principle...

mcav 17y ago
Interesting, but then if one person loses it, you're out of luck.
- paulgb 17y ago
  If you want to get sophisticated you could use Reed-Solomon encoding to avoid this problem. http://en.wikipedia.org/wiki/Reed-Solomon_error_correction http://en.wikipedia.org/wiki/Reed-Solomon_error_correction
jf 17y ago
What you are looking for is Shamir's Secret Sharing algorithm. http://en.wikipedia.org/wiki/Shamirs_Secret_Sharing http://en.wikipedia.org/wiki/Shamirs_Secret_Sharing