Search Results for "hj-split"

Javascript, Python, C++ implementations of Shamir's Secret Sharing algorithm. This is very much a work in progress, and while the functionality is there to split and join, it needs work, cleanup, documentation, profiling and testing. It is only provided in the hopes it may be useful. I make absolutely NO guarantees or warranties, not even of merchantability, either expressed or implied, and do not make any claims about the security or reliability of this project. I do not authorize it's use for anything that is wrong or generally in violation of appropriate laws, or that infringe on other's rights.

...Just vizualize locally the index of stored files and simply select files to download or upload. ImpraStorage automatically launch the parts to download, then merge parts in the appropriate way to rebuild the original file. Inversely, a file to upload is split (in several parts with addition of noise data), and ImpraStorage randomly upload each parts then update the index.

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

Visual Cryptography is a graphical form of information concealing. 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. ...