4 ms·

Hey don't diss xor. If the key is at least as long as the message and is used once, it's unbreakable.

• duaneb 12y ago
  Well, to decrypt the xor'd data you need to keep the key around. So either you a) memorize the entire one-time pad for every file, or b) you encrypt the one-time pads with AES. Now you have two encryption problems.
  • deleted 12y ago
    [deleted]
  • meowface 12y ago
    If only there was a way of generating a pseudorandom stream of bytes with which to XOR against based on a shorter randomly generated key...
• needs 12y ago
  That's the famous one-time-pad :)