• Main Page
• Contacts
• Log In/Submit

XorIt 1.1

Most file encryptors use methods that rely on the theory of computational security, that is difficulty of key factorisation prevents decryption of the file. But this method may not work forever. It used to be considered that a 56 bit key was unbreakable to brute force attacks, but the government of the USA now requires all Top Secret data to use keys of at least 192 bits. This bar will keep raising as computing power increases. (It is argued by some though that this will never happen due to the laws of physics!) XorIt is designed to use conventional XOR encryption on keys that are the same size as the file to be encrypted. Furthermore, if you use an unpredictable file that is the same size (or larger) than the original file and you use this file only once, this is known as a "one-time pad" and it is completely unbreakable, even to computers 1000 years from now. This is because there is no algorithm at all, just a big key, and thus there is no pattern to follow once you have decrypted any part of the file. Thus attempts to decrypt it could result in any file, and there would be no way to verify that it has decrypted correctly.

XorIt is written in Assembly Language for maximum efficiency.

XorIt is a simplified version of our program CryptIt.

Find similar programs1:
encrypt ^{2 3 4 5 6}
vernam
one time pad ^{2 3 4}
security ^{2 3 4 5 6}
file ^{2 3 4 5 6}
sinner ^{2 3 4}
assembly ^{2 3 4 5 6}

• Most file encryptors use methods that rely on the theory of computational security, that is difficulty of key factorisation prevents decryption of the file. But this method may not work forever. XorIt is designed to use conventional XOR encryption on keys that are the same size as the file to be encrypted.
• 
• Anti Virus Report 1
• Anti Virus Report 2
• Download Program
• Download's Map