It's just a dummy thread about the simplest encryption algorithm. For example:

Code:

for I := 1 to Count do
Message[i] := Message[i] xor Key;

However, in pair with well designed and cryptographically secure pseudo random number generator, XOR encryption might be really strong. For example, if key length is equal to the message length, such cipher is unbreakable. It's called the *Verman Cipher.*

In simplest form, for example, how to use XOR with pseudo random number generator:

Code:

{ Initialize the key - this is the password }
RandSeed := Key;
{ Encrypt }
for I := 1 to Count do
Message[i] := Message[i] xor Random(256)

To be continued...