Talk:Secret sharing using the Chinese remainder theorem
![]() | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
|
Example is wrong
editThe example seems to be wrong. You can take two the the modular equations and still find the key easily. 71.190.80.195 (talk) 13:43, 8 May 2009 (UTC)
- if you'll find that, for example, , it means 478 is also a solution, and 633 as well. Since you don't know third equation you don't know which to choose, and all three of them gives different secret:
To find the secret you need to define M' in the ring of 11*13*17 (or bigger), not lesser one. Vlsergey (talk) 07:32, 11 August 2010 (UTC)
This condition is crucial because the scheme is built on choosing the secret as an integer between the two products, and this condition ensures that at least k shares are needed to fully recover the secret, no matter how they are chosen. The following statement is wrong. You are able to solve Mignotte's Secret Sharing Scheme with k-1 shares when using the right program. Click here to see the pdf with a broader explenation. --2001:985:A9A9:1:1DD4:72AC:A2EE:7D85 (talk) 21:50, 30 April 2019 (UTC)Elise