I have important data in a string and I want to randomly divide it into multiple parts(x) and then store it into multiple location(y).
If (locations > parts) how should I go about collecting data pseudo-randomly from x location (may be predefined groups), and able to reconstruct the data i had initially.
Please someone suggest me how to do this?
[EDIT]: I have divided data into 3 equals parts and hide it at multiple locations (6), i.e, every part at 2 locations. Then I pick from any of the two locations to rebuild it.
But I want it to be more efficient and random, therefore I would like to get suggestions on how to do that.
http://en.wikipedia.org/wiki/Erasure_code seems to talking about this sort of problem, and contains pointers to implementations.
http://www.usenix.org/event/fast09/tech/full_papers/plank/plank_html/ describes this sort of thing in the context of RAID.
These are for cases where the object is to reduce the odds of data loss. If the object is to make the data more secure, “secret splitting” might be a good first search term.