Takes a string array of shares encoded in Base64 or Hex created via Shamir's Algorithm
Note: the polynomial will converge if the specified minimum number of shares
or more are passed to this function. Passing thus does not affect it
Passing fewer however, simply means that the returned secret is wrong.
Returns a new array of secret shares (encoding x,y pairs as Base64 or Hex strings)
created by Shamir's Secret Sharing Algorithm requiring a minimum number of
share to recreate, of length shares, from the input secret raw as a string.
Takes a string array of shares encoded in Base64 created via Shamir's
Algorithm; each string must be of equal length of a multiple of 88 characters
as a single 88 character share is a pair of 256-bit numbers (x, y).
Takes a string array of shares encoded in Hex created via Shamir's
Algorithm; each string must be of equal length of a multiple of 128 characters
as a single 128 character share is a pair of 256-bit numbers (x, y).
Takes in a given string to check if it is a valid secret
Requirements:
Length multiple of 88
Can decode each 44 character block as Base64
Returns only success/failure (bool)
Takes in a given string to check if it is a valid secret
Requirements:
Length multiple of 128
Can decode each 64 character block as Hex
Returns only success/failure (bool)
Converts a byte array into an a 256-bit BigInt, array based upon size of
the input byte; all values are right-padded to length 256 bit, even if the most
significant bit is zero.