Search Results for "large files"

...Note: if you have a 64-bit operating system, use 64-bit binary of the utility, because it is significantly faster for large files.

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. ...

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

svn checkout http://umcipher.googlecode.com/svn/trunk/ umcipher-read-only

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...