Search Results for "secret"

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.

Simple program to encrypt text. Programa simple para encriptar texto.

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

This package is a modest implementation of a non-alphanumeric encryption algorithm in java. But I'm kinda looking forward to creating a whole gui app implementing most well-known encryption tools, "the paranoid secret-coder special brainkiller"!

Secret Sharp is a wizard based GUI for the Shamir Secret Sharing Algorithm provided by the crypto++ API. Secret Sharp replicates the functionality that 'ssss' provides on unix.

Cryptomni is a program which can encrypt and decrypt files using the one-time pad cipher. If a key is truly random, kept secret, and never reused, this encryption algorithm can be proven to be unbreakable.

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

In distributed cryptosystem a secret key is distributed among the participants of the system, in the way that only a group of some authorized users can perform any actions related to the secret key. A secret key is used to encrypt a session key, create a digital signature and to certify public keys. The system uses symetric encryption algorithm with a session key to encrypt messages.

RSA (Rivest-Shamir-Adleman) is a public-key encryption algorithm with a typical key size of 1,024 to 4,096 bits. 2 large primes are required to generate the keys. AES (Advanced Encryption Standard) is based on Rijndael, secret-key encryption algorithm using a block cipher with key sizes of 128, 192, or 256 bits. Simple Encrypt will take a text file, generate keys and then encrypt it. The output is the ciphertext and keys. Note: Realistically, I will keep the algorithms simple(r) by having key sizes of 32 bits! Hopefully, I'll get round to developing a reasonably efficient class for larger numbers, but until then I am restricted.