Search Results for "playfair encryption/decryption algorithm"

ParaCrypt is software for encrypting and decrypting data with one-time-pads. For convenience the one-time-encryption-pads are created using pre-shared unencrypted files as sources of entropy.

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.

Encryption with symmetric-key algorithm Kirmah - generate keys with exotic chars - redefine key length - key mark to ensure decryption capabilities - mix data - fast with multiprocessing - possible compression - gui on gtk3 - cli tool - python3 DEPENDENCIES : ======== python3, python-gobject, gobject-introspection, pygtk 3 modes are available to encrypt : ======== - compression (full / disabled or only final step) - random (simulate a random order - based on crypted key - to randomize data) - mix (mix data according to a generated map - based on crypted key - with addition of noise) Process is as follow : ======== encrypt : file > [ compress > ] encrypt > [randomiz data > mix data > compress > ] file.kmh decrypt: file.kmh > [ uncompress > unmix data > unrandomiz data] > decrypt > [uncompress > ] file ======== for encrypt/decrypt large binary files, use the fastest alternative : split/merge

ImpraStorage provided a private imap access to store large files. Each file stored on the server is split in severals random parts. Each part also contains random noise data (lenght depends on a crypt key) to ensure privacy and exclude easy merge without the corresponding key. An index of files stored is encrypt (with the symmetric-key algorithm Kirmah) and regularly updated. Once decrypt, it permit to perform search on the server and download each part. transfert process is...

An Cryptography software with RSA algorithm RSAmake using Python and WxPython written

My first attempt at a one-way hashing class/algoritm, built as a python class. It produces variable length hash from a message block of the size you want. The resulting hash will be ~2x the message block in size, and should provide for at least as many bits of security as the block itself. I updated this, with a different hash than original, since I found a potential collision on some blocks, not but specific to that challenge. To further correct this, I modified the padding when it's...

P.I.G.: Privacy In Gedit, a plugin for gedit, encode and decode text to base64.