A simple implementation of Shamir's Secret Sharing configured to use a finite field in GF(2^8) with 128 bit padding
A simple implementation of Shamir's Secret Sharing configured to use a finite field in GF(2^8) with 128 bit padding
Use shamirs secret sharing scheme to split a seed mnemonic for crypto wallets to multiple mnemonics.
Shamir's Secret Sharing for the browser
A simple implementation of Shamir's Secret Sharing configured to use a finite field in GF(2^8) with 128 bit padding
A simple implementation of Shamir's Secret Sharing configured to use a finite field in GF(2^8) with 128 bit padding
A simple implementation of Shamir's Secret Sharing configured to use a finite field in GF(2^8) with 128 bit padding
A simple implementation of Shamir's Secret Sharing configured to use a finite field in GF(2^8) with 128 bit padding
Implementation of Sharmir's Secret Sharing in Typescript
Mirai Embedded Wallet
A JS/TS implementation of Shamir's Secret Sharing in a finite field GF(2^8)
A simple implementation of Shamir's Secret Sharing configured to use a finite field in GF(2^8) with 128 bit padding
A JavaScript implementation of Shamir's Secret Sharing algorithm over GF(256).
Provides Shamir's Secret Sharing (SSS) functionality for secure splitting and recovering secrets natively on iOS, Android, and Web.
Finding out the faulty key
ntc-ncrypto is a module node cryptography
Some helpers to implement the SSS scheme
A library for managing device authentication using Shamir's Secret Sharing.
#### This PoC is an implementation based on [Shamir's secret sharing](https://en.wikipedia.org/wiki/Shamir%27s_Secret_Sharing) which uses secret.js library.
Ma'atara FHE/MPC cryptographic primitives - Secret Sharing, Additive MPC, Privacy Comparisons
This module can split a secret into n-of-m parts. Learn more here: https://en.wikipedia.org/wiki/Shamir%27s_Secret_Sharing
Generator and Reader for qr codes hiding (and restoring) a secret DAT link in several codes using shamir secrets.
Dark Crystal's wrapper around Shamir's Secret Shares
Secret sharing over hypercore
Small, and secure Shamir's Secret Sharing
A Rust implementation of IBM / HashiCorp Vault's Shamir Secret Sharing (originally in Go under MPL-2.0)
Secret-sharing primitives (Shamir, Blakley, ramp, VSS, CRT, visual, etc.) implemented directly from the original papers with no external dependencies.
A Rust Crate implementation of Shamir's Secret Sharing algorithm
Shamir 3-pass protocol (commutative encryption)
A secure and efficient Rust library for Shamir's Secret Sharing
Implementation of Shamir secret sharing for use with files
A Rust library containing Galois-field types and utilities
Hardened Rust cryptographic library for Shamir's Secret Sharing with support for multiple prime sizes.
A Rust implementation of Shamir's Secret Sharing algorithm using Galois Field arithmetic over GF(256)
a rust implementation of Shamir's Secret Sharing scheme
Shamir's Secret Sharing (SSS) for Rust.
Gem for Shamir's Secret Sharing
Gem for Shamir's Secret Sharing
Helper cryptography module for Ruby
4/12/2016 - NO LONGER MAINTAINED - See README.md Shamirs Secret Sharing is an algorithm in cryptography. It is a form of secret sharing, where a secret is divided into parts, giving each participant its own unique part, where some of the parts or all of them are needed in order to reconstruct the secret. Holders of a share gain no knowledge of the larger secret.
A pure-Ruby experimental implementation of Shamir's Secret Sharing. WARNING: Please be aware that this gem has not undergone any form of security evaluation, and is provided for academic/educational purposes only. This gem is not recommended for usage under mission-critical circumstances and should not be relied upon to protect confidential or secret information, or any information with high availability or integrity requirements. This gem should be treated purely as a proof of concept and/or learning exercise. Users should assume that this gem is insecure and that any data it is used to split into shares may be lost.
Split and reconstruct secrets using the shamir's secret sharing algorithm
Splits uploads using Shamir Secret Sharing across one or more other Active Storage services
Implements a special case (k = 2) of Adi Shamir's secret sharing algorithm. This allows secret files to be encrypted on disk and require two secret holders to decrypt it.
WARNING: Please be aware that this gem has not undergone any form of independent security evaluation and is provided for academic/educational purposes only. RHUBARBCIPHER should not be used to encrypt any data with high confidentiality, availability or integrity requirements, and should be treated purely as a proof of concept and/or learning exercise. RHUBARBCIPHER is an experimental multi-key file encryption/decryption system for GNU/Linux and BSD that combines one-time pad encryption/decryption with Shamir's Secret Sharing in an attempt to encrypt files in a versatile yet information-theoretically secure manner. RHUBARBCIPHER only works well on smaller files (e.g. less than 15000KiB) due to the time taken to encrypt/decrypt data, which increases as a function of file size. It includes an optional decoy feature which allows users to specify a decoy file and generate a set of decoy keys in addition to the real keys. Size similarity between the decoy file and the real file is strictly enforced.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.