Voting

: min(nine, four)?
(Example: nine)

The Note You're Voting On

kimcbrowne at hotmail dot com
19 years ago
To be unbreakable XOR encryption must have a key that is totally random and is never re-used. If you use a key a second time, it can be broken. This can be confirmed by reading the page at http://en.wikipedia.org/wiki/One-time_pad.

Although I am not an expert on cryptography, I understand that decyphering involves recognizing patterns and that it would be possible to decrypt code that was encoded using XOR with the same key if there were enough samples to examine. Maintaining unique keys for each encryption at both encryption and decryption points to ensure 100 percent unbreakability has security problems of its own - where and how are the keys stored and how are they transmitted to the decryption points?

<< Back to user notes page

To Top