Abstract
Shamir’s Secret Sharing Algorithm is a form of secret sharing, where a secret is divided into parts, giving each participant its own unique part. To gain the original secret, a minimum number of parts, in other words, the threshold is required. What are the basic terms of this algorithm, how it works, how share computation and secret reconstruction are done, and also how can it be used in the implementation of Redundant Array of Independent Disks (RAID) will be main goals of our work.