Given a threshold t, sharesecret splits a secret into parts, such that exactly t parts are needed to reconstruct the secret. If you have fewer parts you know only the approximate or exact length of the secret.
Information regarding Project Releases and Project Resources. Note that the information here is a quote from Freecode.com page, and the downloads themselves may not be hosted on OSDN.
Splitting of sharesecret into several smaller and simpler programs, making the usage simpler. The limit of the number of parts is now higher than 65000.
Sharesecret no longer uses GNU MP. If available, it uses GNU PG or /dev/random as a pseudo random number generator or arcfour as a fallback. The format of the parts has changed completly; old formats are not supported anymore.
