Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Error Retrieving Original Mnemonics From 2 Shares whith a Threshold Of 3 Out Of 5. #29

Open
Illuvelijah2004 opened this issue Mar 25, 2023 · 1 comment

Comments

@Illuvelijah2004
Copy link

Illuvelijah2004 commented Mar 25, 2023

It is not possible to generate the original secret with only two shares because the threshold for reconstructing the secret in this case is 3 out of 5 shares. The Shamir secret sharing scheme requires at least as many shares as the threshold to reconstruct the secret. In other words, if the threshold is 3, then at least 3 shares are required to reconstruct the secret. Using fewer shares than the threshold will not provide enough information to reconstruct the secret.

If we try to reconstruct the secret using only two shares, we will not have enough information to do so. Even if we know the coefficients a1 and a2, we would not be able to determine the constant term of the polynomial, which is the secret, without additional shares. This is because the constant term is a free term in the polynomial, and can take any value in the finite field.

If we try to use only two shares to reconstruct the secret by applying the Lagrange interpolation formula, we will obtain a polynomial of degree 1, which will not match the original polynomial of degree 2 that was used to generate the shares. As a result, the reconstructed secret will be incorrect.

Therefore, at least as many shares as the threshold specified in the Shamir secret sharing scheme to ensure that the secret can be reconstructed correctly.
My BTC address is; bc1qvr9p54z9qjpklxd2ejz47y88g0nt0t85xs8f4l

Am waiting for my reward for finding a bug

@tawhidnazari57
Copy link

It is not possible to generate the original secret with only two shares because the threshold for reconstructing the secret in this case is 3 out of 5 shares. The Shamir secret sharing scheme requires at least as many shares as the threshold to reconstruct the secret. In other words, if the threshold is 3, then at least 3 shares are required to reconstruct the secret. Using fewer shares than the threshold will not provide enough information to reconstruct the secret.

If we try to reconstruct the secret using only two shares, we will not have enough information to do so. Even if we know the coefficients a1 and a2, we would not be able to determine the constant term of the polynomial, which is the secret, without additional shares. This is because the constant term is a free term in the polynomial, and can take any value in the finite field.

If we try to use only two shares to reconstruct the secret by applying the Lagrange interpolation formula, we will obtain a polynomial of degree 1, which will not match the original polynomial of degree 2 that was used to generate the shares. As a result, the reconstructed secret will be incorrect.

Therefore, at least as many shares as the threshold specified in the Shamir secret sharing scheme to ensure that the secret can be reconstructed correctly. My BTC address is; bc1qvr9p54z9qjpklxd2ejz47y88g0nt0t85xs8f4l

Am waiting for my reward for finding a bug

bc1pa4ul5faf0ramz70c54vdtlkcnq72juave8hfkg4ptl3756slv30srcky7x

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

3 participants
@Illuvelijah2004 @tawhidnazari57 and others