Good Morning. I need to resorve this problem. I have three fragments that I make with shamir's secret perfect and now I need to find the polinomy, but I don`t know if there is a method which I can to solve the polinomy and have the secret with Sage.
For exemple I have this polinomy 56 + 10x + 5x^2 mod 101. I know that the secret is 56 and three fragments [25, 98], [47, 57], [19, 31], (56 +1025+525^2)mod 101 = 98
How I can to find the polinomy with these fragments? I can't use Lagrange because it is arithmetic modular.
asked May 20 '12
You seem to be refering to Shamir Secret Sharing a secret-sharing scheme invented by Shamir: paper here
Described nicely here: http://en.wikipedia.org/wiki/Shamir%27s_Secret_Sharing
The following Sage code works fine to reconstruct the polynomial from the shares:
posted Jun 29 '12Sigurd Meldgaard
11 ● 1 ● 1
Asked: May 20 '12
Seen: 131 times
Last updated: Jun 29 '12
powered by ASKBOT version 0.7.22
Copyright Sage, 2010. Some rights reserved under creative commons license.