Tool for gf256 (Galois field) computation.

Arithmetic in GF(256)

Uses Shamir's secret sharing method to allows space-effecient secret sharing (splitting) that requires a minimum threshold of shares in order to unlock the orignal secret.

Finite field GF(2^8) arithmetic with the AES reduction polynomial: multiply, inverse, exp/log tables and Reed-Solomon helpers.

Typescript implementation of Shamir Secret Sharing for BIP-39 mnemonics

k-of-n Shamir Secret Sharing of the vault KEK for multi-party unlock. Any K of N shares recombines the key; fewer than K leaks zero bits. Composable — each share can be protected by any other on-* method. Math and share codecs live in @noy-db/shamir and a

A JavaScript module, ShadowDom compatible version of Lazersoft superb JavaScript QRCode reader

A general-purpose Galois field implementation.

Native module for math with galois fields

Shamir's Secret Sharing over GF(256) with BIP-39 word encoding for human-readable share exchange

GF(256) Shamir's Secret Sharing — split and reconstruct secrets with threshold schemes

LombokECC — Reed-Solomon error correction library with multi-language ports

Shamir Secret Sharing over GF(2^8), byte-wise, plus the share codecs (bytes / base32 / JSON). Pure math, zero dependencies, no hub contract — the primitive @noy-db/on-shamir builds its unlock method on.

Algebraic compressor for GF(2⁸) linear recurrences — Berlekamp-Massey + LFSR encoding for PRBS streams, firmware, and telecom payloads