This program will take some data as an ASCII string and split it up into N pieces, M <= N of which can be used to reconstruct the original string. The pieces are provided in base 58 with a Bitcoin-style checksum. You can safely make up to one recording error per piece and the secret string will still be recoverable.
Generate M messages, N of which can be used to restore the original secret requires entropy provided by the user.
./SecretShare split <secret: string> <num_pieces: uint> <threshold: uint>
From any number of messages >= N, restore the original secret.
./SecretShare merge <threshold: uint> <pieces: string...>
mkdir build
cd build
conan install ..
cmake .. -DCMAKE_CXX_COMPILER=g++-10
make
Binary file will be in build/bin.