Search Results for "scheme"

...Developed by the Cryptography and Privacy Research group at Microsoft, it enables software engineers to build end-to-end encrypted data storage and computation services that never have to procure the customer's key. Microsoft SEAL is very easy to use, compile and run in many different environments. Homomorphic encryption is an encryption scheme that allows the cloud to compute directly on the encrypted data, without requiring the data to be decrypted first. This results in encrypted computations remaining encrypted, decrypted only by the data owner using the secret key.

This package attempts to reduce the likelihood of sensitive data being exposed when in memory. It aims to support all major operating systems and is written in pure Go. Sensitive data is encrypted and authenticated in memory with XSalsa20Poly1305. The scheme used also defends against cold-boot attacks. Memory allocation bypasses the language runtime by using system calls to query the kernel for resources directly. This avoids interference from the garbage collector. Buffers that store plaintext data are fortified with guard pages and canary values to detect spurious accesses and overflows. ...

A version of Plum Cave that employs the "ChaCha20 + Twofish-256 CBC + HMAC-SHA3-512" authenticated encryption scheme for data encryption and ML-KEM-1024 for quantum-resistant key exchange.

PureBasic Shamir Secret Sharing is an open-source, self-contained and educational implementation of the Shamir Secret Sharing Scheme, written entirely in PureBasic. Shamir Secret Sharing is a cryptographic method that splits a secret into multiple parts (shares), such that any combination of at least T shares can reconstruct the original secret, while any number of shares fewer than T reveals no usable information. This implementation operates over the finite field GF(257), allowing correct handling of all byte values (0–255) without loss, making it compatible with any type of string or binary-compatible data. ...

Horcrux is a command-line tool built in Go that enables you to split a file into encrypted fragments (“horcruxes”) so you don’t need to remember a pass-code for later decryption. It uses the Shamir Secret Sharing scheme to break an encryption key into multiple pieces, such that only a threshold of them can reconstruct the original file. You select the number of fragments to create and the minimum number required to recover the file, then scatter the fragments (e.g., on USBs or cloud locations). The tool provides a “split” command to create the fragments and a “bind” command to recombine them to the original file. ...

LDWM: Hash-Based Signatures (draft-mcgrew-hash-sigs-02), PHP implementation of IETF pqcrypto algorithm specification

Java implementation of Shamir's Secret Sharing algorithm as described in Applied Cryptography [as LaGrange Interpolating Polynomial Scheme].

Real-Time Proactive Secret Sharing Library for RTAI is an implementation of the Shamir's secret sharing scheme and Herzberg's proactive secret sharing algorithm. The library uses a port of GNU GMP in order to make multiple precision arithmetic operatio