https://github.com/grevend/shamirs-secret-sharing
Performant secret sharing scheme implementation based on polynomial interpolation over finite fields
https://github.com/grevend/shamirs-secret-sharing
assembly c deno ffi rdrand secret-sharing shamir
Last synced: 6 months ago
JSON representation
Performant secret sharing scheme implementation based on polynomial interpolation over finite fields
- Host: GitHub
- URL: https://github.com/grevend/shamirs-secret-sharing
- Owner: grevend
- License: apache-2.0
- Created: 2022-09-10T12:29:46.000Z (almost 4 years ago)
- Default Branch: main
- Last Pushed: 2023-12-15T02:37:58.000Z (over 2 years ago)
- Last Synced: 2025-10-23T06:14:10.379Z (9 months ago)
- Topics: assembly, c, deno, ffi, rdrand, secret-sharing, shamir
- Language: C
- Homepage: https://deno.land/x/shamirs_secret_sharing
- Size: 48.8 KB
- Stars: 0
- Watchers: 1
- Forks: 1
- Open Issues: 4
-
Metadata Files:
- Readme: README.md
- License: LICENSE
- Code of conduct: CODE_OF_CONDUCT.md
Awesome Lists containing this project
README
# Shamir’s Secret-Sharing Scheme
A preponderance of the open-source Shamir’s Secret-Sharing Scheme implementations operate on a finite field $\mathbb{F}_q$, where $q$ is dependent on both the secret size as well as the number of shares, thus requiring both the search for a sufficiently large prime as well as the support of a large enough number representation or chunking of the secret. This implementation outlines an optimized low-level c and inline assembly-based alternative that uses the Galois field $2^8$, referred to as GF(256), along with a Reed-Solomon inspired encoding approach and a hardware-accelerated entropy sourced secure number generator to offer the theoretical capacity to process secrets up to 8 Exabytes.