Search Results for "together"

...The code is shared here for posterity (future folk) in the guise that it may help others also on the path to cryptography. This code demo uses a 256bit rolling hash table (8x8bytes) at its heart to mix together pre-defined parameters in a way that allows the cipher to produce encoded output that is locked to a key of arbitrary length without padding. Based upon some random data points the cipher produces encoded output that is non-deterministic in nature, the same key and message will never produce the same output each time it's run. ...

...You can use Lecithine as regular file system. When writing to disk, data will be devided into randomly chosen pieces (secret shares) and stored into different places. Upon reading, the shares are merged together such that in turn the plaintext results. From a cryptographers point of view, there is no symmetric or private key ever needed to produce a ciphertext. This is how secret sharing schemes are designed.

This ASN.1 compiler turns ASN.1 specifications into C code. The asn1c is shipped together with conformant BER/DER/XER/PER codecs. The X.509, GSM TAP3, MEGACO, RRC and LDAP encoding and decoding examples are part of the source code distribution. NOTE: THE asn1c PROJECT HAS LARGELY MOVED TO GITHUB: http://github.com/vlm/asn1c

...In a 2-out-of-2 Visual Cryptography Scheme a dealer will "split" a secret image into two shares, print the shares onto separate transparencies and hand them to the participants to the scheme. If the two participants come together, they'll be able to reveal the secret image without a computer, perfectly superimposing the transparencies they own. Analyzing a single share, no one will be able to obtain any information considering the secret image no matter the computing or the analyzing power. In an Extended Visual Cryptography Scheme, both the secret image and the shares are meaningful images like a landscape, a building or a beautiful girl, hiding the very intention to conceal a secret. ...

cst allows to split (or share) "secret" files, like private keys, into number of equal parts. After that, secret can only be recovered by collecting all parts together. If any of this parts is lost, the secret is lost too.

CryptoHelper is a Java program designed to aid in the decryption of classical ciphers, ie pre WWII ciphers. It brings together tools like frequency analysis, friedman tests, enciphering/deciphering for several clasical ciphers, and brute force algorithm

In DeCrypto you will find a collection of scripts for helping decrypt messages. Eventully I am going to put these scripts together into a nice interface.