Unbreakable Ecryption

The World's Simplest Algorithm for Unbreakable Encryption

Messages encoded with this technique are absolutely unbreakable, both now and 1000 years from now.


Create a very long random key. For example, fill an entire CD with a series of random numbers generated from radio static. Make sure they are truely random with no pattern at all. Don't use a pseudo-random number generator - that is actually a pattern.

Create a copy of the CD. Give the copy to the person who will be decoding your messages.

Perform an XOR function on every byte of the message with the corresponding bytes from the CD.

With each new message do the same thing as above but start with the next unused position on the CD. You cannot reuse any of the random keys.

The resulting codes are totally unbreakable. They can be sent to your recipient.

To decode the messages follow steps two through four using each coded message in place of each original message.

The only drawback to this method is that you need a CD with a truly random pattern and the person you send codes to needs a copy. This is the reason why so much effort goes into other methods, particularly methods involving private key / public key encryption (also called asymetric key encryption).

At best, those methods have resulted in "strong encryption" which means it's tough enough that nobody can break it at this time. None of them compare with the absoluteness of the method above.