Inside adversary combinatorial attacks in secret sharing scheme via linear system of equations when n = 5

When an insider possesses greater than or equal to the threshold number of secret shares, he can retrieve an entire secret without any difficulty. This kind of task doesn’t have any big problems. In this work, even if the inside adversary only knows a smaller number of secret shares than the threshold amount, we give the different computational approaches to retrieve the whole secret share. We limit five secret shares in this investigation to be used only for calculation. The assaults in this work are classified into four categories utilising probabilistic and algebraic systems of linear congruence relations, based on the number of secret shares of the adversary and the order of an algebraic field where the secret shares are formed by the distributor. Together with these assaults, this study offers a worst-case and bestcase outcome for the inside adversary to retrieve the entire secret. The relationship between the threshold value t and the quantity of secret shares n is the basis of these scenarios. Lastly, we displayed the graphical analysis about the quantity of shares in the secret sharing system as well as the order of an algebraic field in which the distributor creates the secret shares.