Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I want to implement Shamir’s Scheme in C# ,and I don’t understand how can be obtained the secret, corresponding shares (I1 .. I5),
and how can be reconstructed secret ?
in exemple: 1.1
https://docs.google.com/open?id=0BzdtLhyvFABCNzllZGJjMjUtOGU2ZC00ZTRjLTg5NGMtMzcxYTU3MjEwZmNm
I think I1=8 from P(1) mod 11; but I2 = 10 != p(2) mod 11
Thanks.
If you mean you want to implement it yourself: perhaps you’re better off posting this question on: https://crypto.stackexchange.com/ .
If you just want to do cryptography in C#: check out http://msdn.microsoft.com/en-us/library/system.security.cryptography.rsacryptoserviceprovider.aspx