Open Source Linux Cryptography Software

CaesarCipher is a simple tool which helps you de/encrypt texts with the caesar cipher. This tool should not be used to encrypt sensitive data like passwords or personal information.

Cryptography Tools is a project to develop demonstration tools on classic (currently Caesar and Playfair) & modern crypto-systems, including private & public key encryptions, digital signatures, cryptographic hashes and authenticated encryption.

MD5-utils is a script for MD5 hash function manipulations. It can crypt one or more word(s) and try to crack one or more hash(es) using online servers.

With BinaryCrypt, you can convert between regular text, binary, hexadecimal, octal decimal and decimal. You can convert only decimal (as of right now) to any base up to base 64. You can also save your converted text to a file or open a converted text file to decrypt the message, and perform basic arithmetic in binary. The git repo for the C# code is located at: https://github.com/m1r4g3/BinaryCrypt-.Net

ISAAC is a cryptographically secure pseudo-random number generator (CSPRNG) and stream cipher. It was developed by Bob Jenkins from 1993-1996 and placed in the Public Domain. ISAAC is fast - especially when optimised - and portable to most architectures in nearly all programming and scripting languages. After more than 20 years of existence ISAAC has not been broken, and the little program you have here allows you to use it to encrypt and decrypt text of arbitrary length, files of any type, on a key-phrase of any complexity. ISC is a symmetric key encryption system, which means that both the sender and recipient of a message must possess the key.

AUM is an extremely fast, small-state, cryptographically secure pseudo-random number generator and stream cipher. AUM exhibits uniform distribution, mixes rapidly, has no detected bias, and comes in three variants: AUM16, with an internal state array of 16+4 32-bit words; AUM32, with an internal state of 32+4 words; and AUM64 with a 64+4-word state. The former permit seeding with a key of up to 512 or 1024 bits, the latter with a 2048-bit key.

BEDBUG is a small, fast, cryptographically secure pseudo-random number generator (CSPRNG) and stream cipher. It exhibits uniform distribution, mixes rapidly (with worst-case avalanche better than 16-bits), has no detected bias, and comes in three variants: BEDBUG128, with an internal state array of 128+3 32-bit words; BEDBUG256, with an internal state of 256+3 words; and BEDBUG512 with a 512+3-word state. The former permit seeding with a key of up to 4096 or 8192 bits, the latter with a 16384-bit key. The BEDBUG generator itself is a mere 5 lines of code: Three rotations; two pseudo-random lookups. The default BEDBUG configuration alternates the rotation constants unpredictably. These four sets of three values differ between BEDBUG128, BEDBUG256 and BEDBUG512 and were selected, tuned and tested in each case for optimal avalanche, which is never less than 16.5 bits. BEDBUG has passed stringent industry-standard tests for randomness, including NIST and DIEHARD.

/!\ Developer(s) needed to optimize routines, multi-processing; any kind of help is accepted :)

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

Cryptography Workshop is a small yet powerful tool for cryptography and cryptanalysis. It's focused more on classic cryptography. It is currently in alpha and under development.

Easy-SEND is an implementation of the SEND (SEcure Neighbor Discovery) protocol for IPv6. It is aimed to be used for learning and testing purposes. SEND is described in RFC 3971. Easy-SEND includes a tool (CGAGen) to generate and verify CGAs (RFC 3972).

This is a project that simulates the German Military Enigma machine during WWII.. It is a project for beginers to learn to program and to meet people. If anyone is interested in helping, please email me @ dustin@rockhill.org

FroZenLight connects simple line art and mathematics. The source of light can be positioned so that either symmetric reflection patterns or secret messages (Cryptography) are created. Example light patterns and math exercises for education are provided.

This is a simple encryption tool to work with home-grown encryption algorithms. It can run as either a GUI, a command-line application, or a network proxy.

JCrypTool moved to GitHub! See https://groups.google.com/d/topic/jcryptool-developers/nauEXL6vsbk/discussion for more information and visit our new project home at https://github.com/jcryptool

JCrypTool moved to GitHub! See https://groups.google.com/d/topic/jcryptool-developers/nauEXL6vsbk/discussion for more information and visit our new project home at https://github.com/jcryptool

MOTE is a fast, small-state, cryptographically secure pseudo-random number generator (CSPRNG) and stream cipher. MOTE exhibits uniform distribution, mixes extremely rapidly, has no detected bias, and comes in three variants: MOTE8, with an internal state array of 8+4 32-bit words; MOTE16, with an internal state of 16+4 words; and MOTE32 with a 32+4-word state. The former permit seeding with a key of up to 256 or 512 bits, the latter with a 1024-bit key. Reduced to essentials, MOTE is only 5 lines of code: Ten arithmetic and bitwise operations in all. It's called MOTE because a PRNG can't be made much smaller (or faster) without introducing bias or severely reducing avalanche. MOTE alternates its shift and rotation constants unpredictably, and has passed the most stringent industry-standard tests for randomness and security, including NIST & DIEHARD.

Mini md5 Cracker, como su nombre lo dice es un software para Windows de Crackeo de hash MD5 por Wordlist y Brute Force, escrito en C#, con GUI, sencillo, pequeño, rapido.

NAC is a collection of tools for cryptography. The goal is to provide simple-to-use crypto tools (like an OTP, String and number generator, public key algorithm...) you can use under Linux, Windows...

This simple script is used to make an easy login script without the need for MySql! Perfect for admin accounts, etc.

SES brings back the uncrackable onetime pad, with a digital twist. It is well known that a random key of message-length is the only provably unbreakable cipher. SES uses cryptographic strength pseudo-random keys of message-length for its many encipherments, in addition to offering true one-time pad capability for the intrepid. SES is built on ISAAC, Bob Jenkins' unbroken CSPRNG, a fast and simple stream cipher placed in the Public Domain in 1996. SES now gives you the ability to efficiently cipher text of arbitrary length or files of any size or type. Use it with confidence. To achieve complete one-on-one privacy, SES traverses several levels en route to its output. The more words in your key-phrase, the more layers of encipherment SES applies. It is part Vigenere, part onetime pad, part cryptographic hash, not to mention the essential scrambler element, each component driven by ISAAC, with all key-derivation and stretching relying on Keccak in 512-bit configuration.

A program rövid üzeneteket tud elrejteni, kódolni latin nyelvű disztichonos versekben. Dekódolni is tudja az ilyen titkosított üzeneteket rejtő verseket. Ezen kívül véletlenszerűen is tud verseket generálni. Minden generált vers értelmes latin nyelvű költemény.

MOTET is a tiny, fast super-encipherment application written in C, featuring the new CSPRNG/stream ciphers MOTE and BEDBUG in each of their three variants, as well as the "gold standard" among ciphers, ISAAC. MOTET brings multiple levels of encryption, including a ciphertext-hash, a Vigenere mixing function, a choice of Caesar MOD or Caesar MIX ciphering on the primary key-stream, plus a deeply scrambled "outer shell" as a final super-encryption stage. A unique nonce IV guarantees that each ciphertext will differ radically from every other, even on the same message and identical key.

The Eclipse XML-Security Plug-In allows you to experiment with the W3C recommendations on digital signatures and encryption and to learn all about their background. Arbitrary XML documents can be canonicalized, signed, verified and en- or decrypted.

a number of clients try to find a secret key by calculating the encryptions to all possible keys of a given key range and comparing them to the encryptin of the secret key until a matching one is detected....