Codex 32 A Shamir Secret Sharing Scheme |
|
| Author:
| Curr, Leon Olsson
Snead, Pearlwort |
| Engineer:
| Curr, Leon Olsson
Snead, Pearlwort |
| Editor:
| Beck, Arri Isak |
| ISBN: | 978-1-7338712-2-8 |
| Publication Date: | Oct 2022 |
| Publisher: | Bickers & Son
|
| Book Format: | Paperback |
| List Price: | Contact Supplier contact
|
Book Description:
|
Codex32 is an error-correcting code designed to be computable without the use of electronic computers. Users can compute and verify checksums by hand; we have provided lookup tables, volvelles and worksheets to assist with this process.The codex32 checksum, like all linear codes, is compatible with Shamir's Secret Sharing Scheme, a mechanism to split a secret into many "shares", such that the original secret can be reconstructed from some number of them. In SSSS, users choose a...
More DescriptionCodex32 is an error-correcting code designed to be computable without the use of electronic computers. Users can compute and verify checksums by hand; we have provided lookup tables, volvelles and worksheets to assist with this process.The codex32 checksum, like all linear codes, is compatible with Shamir's Secret Sharing Scheme, a mechanism to split a secret into many "shares", such that the original secret can be reconstructed from some number of them. In SSSS, users choose a threshold value k, typically 2 or 3; they then generate k-many random shares, and then compute a number of derived shares (up to 31 in total). A random secret can then be computed from any k shares.If the initial random shares have a valid codex32 checksum, then so will all the derived shares and the final secret.