Here's one I wrote that wraps the algorithm with passwords https://github.com/ryancdotorg/threshcrypt and you can set the same password multiple times to accomplish the second 'advanced scenario'.
hmm.. the article says: "If we encoded our secret with a cubic function and distributed coordinate sub-passwords it would require any combination of four points to determine the intercept and the secret."
Maybe I'm missing something here, but, taking any of the cubic function diagrams as example, what if all four coordinates have their "x" between -10 and 0? Those four coordinates will not be enough to generate the whole curve, no?
10 comments
[ 3.4 ms ] story [ 33.6 ms ] threadSkip to >>Shamir’s Algorithm<< section to get to the most interesting part.
Docs at http://point-at-infinity.org/ssss/, demo at http://point-at-infinity.org/ssss/demo.html and it can be installed on ubuntu through the 'ssss' package, listed as ssss - Shamir's secret sharing scheme implementation.
Maybe I'm missing something here, but, taking any of the cubic function diagrams as example, what if all four coordinates have their "x" between -10 and 0? Those four coordinates will not be enough to generate the whole curve, no?
As soon as you have 4 points, these 4 points uniquely define a cubic. Even if those 4 points are "right next" to eachother.
If this is difficult to imagine, it is the same with a line. Wherever you place 2 points, they always uniquely define a single line.
Unless, of course, you place 2 points exactly on top of eachother.
edit: I suppose this counts as proof http://www.had2know.com/academics/cubic-through-4-points.htm..., but atm I don't remember why matrixes are connected with equations.