Secret sharing supports splitting the secret value S into N shares, and setting a threshold value k. If no less than k shares of secret information are collected, the secret value S can be recovered jointly. If there are less than k shares, no information about S can be obtained. . Secret sharing is mostly used for distributed management of sensitive data. Common secret sharing methods include Shamir secret sharing, Blakley secret sharing, and CRT secret sharing.
An overview of the Shamir secret sharing algorithm:
Golang code implementation of Shamir algorithm:
1. Split the secret value S into N shares
2. Use no less than k shares of secret information to restore the secret value S
