Application Name | Crush Cryptonizer |
Version | V1.1b |
Short Description | Scramble short files in an absolute super-secure way |
Supported OSes | Windows |
Web Page | - |
Download Link | Crush Cryptonizer V1.1b |
Sourcecode | Crush Cryptonizer V1.1b Sourcecode |
System Requirements | - Pentium 0.01Mhz should take a while but be enough to encrypt. You´ll need a quantum computer to decrypt it if you try to crack a crypted file
|
Version History | - 08/12/01 Idea V1.0
- 08/12/21 Release V1.0
- 08/12/28 Release V1.1
- 09/02/27 Release V1.1b (several internal fixes)
|
Author | Crush |
DescriptionYou can crypt/decrypt in an extremely high secure way short files. I´d say there´s currently no harder encryption existing. It´s not based on standard crypting routines like AES, Serpent or Twofish and hashes like RipeMD, SHA or others. The program has exclusive in-built cruelty-cryptonite that makes it unusable for realtime-encryption/decryption!
FeaturesThe strength is its combination of iteration calculations, salt generation, code-shuffle algorithm that gives you the power to decide how long someone will take to decrypt it properly. This means: You can crypt a 4-byte text as example so hard that the decryption with the key could take several years on a Cray XT5 supercomputer if you like
- the only problem is: You also need the same time to encrypt
Technical information:
A number, password or file can be used as input salt. Even if you take the same settings for encryption your encrypted file will be everytime totally different. During the whole process a shuffle-index is recalculated constantly from the results and the actual salt/key. The datas are eored and shuffled with the complete salt. Shuffling means the bytes are changed in the destination datas and the salt itself and so change the next following encryption pass. If the salt is longer than the datas to encrypt it starts at the beginning with this predure - so the start position of the encryption can change every loop. While shuffling it calculates from the actual salt a new shuffle-index in a ping-pong way. This index shuffles the salt itself. It´s because of the nature of the calculation impossible to shorten the encryption in any way. You need to calculate the whole way back with all iterations to get to the original datas and to decrypt all you also need the position where to start in the salt. It´s not even the most imaginable secure way to crypt datas. Additionally it fully supports [url=http://en.wikipedia.org/wiki/One-time_pad]One-time pads. That is till now with right usage an uncrackable way of encryption (Wikipedia cit.: "The one-time-pad is the only cryptosystem with perfect secrecy... OTP can be used, along with a more standard cryptosystem, in a superencryption scheme).
Planned FeaturesUsageInstallationYou need nothing special to do - only run the .exe file
Using the ApplicationRead the readme.txt
UninstallationOnly delete the file
Known Issuesnone at the moment
Screenshot