Specific implementation of Secret Sharing Algorith by Adi Shamir: https://en.wikipedia.org/wiki/Shamir%27s_Secret_Sharing
The following code assumes N=2 and K=2 where N is the total number of parts and K is the mininum number of parts for message completeness