Hi Wizard!

Even after a complete scrambling, I'd still say no. I'm having fun here XP

I started to decrypt something, but the secret key is a pain to find.

So just to make things a little clearer for me, the table is known, the encryption is known, but supposedly if you don't have the private key, and the algorithm that uses that key to reference into the table, then there is no way of decoding the message, is that about right?

1. the table is known- yes

2. the encryption is known- the algorithm is not known! I haven't published it here. Only the chipertext is known (chipertext is the encrypted text; plaintext is the unencrypted text- the original text)

3. when talking about symmetric algorithms, people usually say secret key, or just key, rather than private key. This comes because when talking about asymmetric algorithms, we have public and private keys, which is different from the symmetric algorithm's key. So, what you mean is correct- if you do not have the key, then you can hardly decode the message. But some cryptoanalysts manage to break some messages without ever knowing the key.

One way to achieve that, is to make statistical analysis on the text, and use a statistic report table which reports the occurance (in %) of every letter in a text. This is research made by organizations, and such tables are open to the public.

So, after you made a statistical analysys of the chipertext, then you have build a table which will contain the occurance (in %) of every symbol. Then, using the table from the public reports, you can assume that the most used symbol is the character "e". Also, you can assume that the last character in the text will be ".".

Unfortunately, this method is not very good nowadays, because:

1) It won't work in algorithms like mine (and mine is based on the sceleton of another algorithm)

2) Nowadays algorithms are such that the chipertext's length is different than the plaintext's length. In this case, such statistical reports are useless.

Now, another tip about the algorithm. You need to know two values: the key and a value that I named "portion".

The key in this case is 5bit, i.e. it is 5 symbols (chars,digits,symbols) long.

The portion value, is the length of one portion of data being encrypted with the key. The portion is measured in bits (i.e. number of characters).

Feel free to ask... I will be happy to help you!

After all, the algorithm I used will go public, but we can have fun before that!