Let's have an encryption CHALLENGE!

[Agamemnus]

Well, as far as I know, any ciphertext that is not completely random (any character is equally likely, and there is no pattern to the appearance of each character) is always breakable.

The way that it is done in AES (Advanced Encryption Standard) uses the password and the plaintext to repeatedly reorder and permute the characters.

So does the way I described in the first link. (hopefully clearly)

My algorithm, again:

1) combine password and plaintext like so (wraparound to end):
password bit / ciphertext bit / output bit
0 0 0
1 1 0
0 1 1
1 0 1

2) Separate each plaintext into powers of 2 partitions.

3) For each partition, convert every 2 bits like so:
11 >10
10 >11
01 > 01
00 > 00
P1, P2 > A > A1

So, it is rearranged in two parts A and A1. Then perform (1) on A again. A is then subdivided the same way again into A and A2, etc.. until A is just one digit long.

Then A becomes A + A1 + A2 + A3...etc.

4) Merge all the partitions back together.