C++ implementation of Shamir Secret Scheme over GF(256)
-
Updated
Jan 26, 2026 - C++
C++ implementation of Shamir Secret Scheme over GF(256)
Crypto library written in pure Lua 5.1 which includes X25519, ChaCha20, BLAKE2s and more.
Reproducible exploratory notes and scripts for one GSMG 5 BTC puzzle branch
Shamir's Secret Sharing over GF(256): split a secret into N shares, recover with K. Pure client-side math.
This is an implementation of Reed–Solomon FEC based on GF(2^8) by C++
Browser-based demo of Shamir's Secret Sharing — split a secret into n shares, reconstruct from any k. Polynomial curve visualization, information-theoretic security proof, and AES key protection. Invented by Adi Shamir (Weizmann Institute, Israel) in 1979.
Reed-Solomon Encoder, using Berlekamp-Massey, Forney Algorithms.
GF(256) Shamir's Secret Sharing — split and reconstruct secrets with threshold schemes
Constant-time SLIP-0039 Shamir's Secret Sharing for Go. Bitsliced GF(256), memory zeroing, zero data-dependent branches.
Laboratory environment for Shamir’s Secret Sharing research, fuzzing, cracking experiments, and edge‑case analysis.
Add a description, image, and links to the gf256 topic page so that developers can more easily learn about it.
To associate your repository with the gf256 topic, visit your repo's landing page and select "manage topics."