No description available

Shamir Secrets implements in Net Core 3.1

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

Reference-grade implementation of Shamir Secret Sharing with modular encoding and audit-ready structure.

A Rust project teaching the core mathematical primitives that power modern Zero-Knowledge Proof systems. Features NTT, Horner's Algorithm, and Shamir's Secret Sharing.

It involves implementing a simplified version of Shamir's Secret Sharing algorithm. The core concept is to reconstruct a secret (the constant term of a polynomial) given a set of points that lie on that polynomial.

RSA (Rivest-Shamir-Adleman) is a widely-used public-key cryptosystem that allows for secure data transmission, especially for encrypting sensitive information and digital signatures. The system is based on the mathematical challenge of factoring large numbers, which forms the core of its security.

RSA factoring, often referred to as RSA encryption or RSA algorithm, is a widely used method for securing communications over the internet. It's named after its inventors: Ron Rivest, Adi Shamir, and Leonard Adleman. At its core, RSA encryption relies on the difficulty of factoring large prime numbers.