Don't mistake my bluntness for malice, but you do not understand very much about cryptography and your code is almost certain to be fatally flawed. First, you don't seem to understand either Kerchoff's principle or unicity distance.

Kerchoff's principle, a long-held principle in cryptography, is that your system should be secure even if all of the information about how the system works is public. Only the key is kept secret. Publish your algorithm and maybe someone can offer feedback. If your algorithm does not use a key, it is neither secure nor useful per Kerchoff's principle.

Unicity distance is the amount of ciphertext needed to ensure that there is only one meaningful decryption. You've given us a very large ciphertext that corresponds to a plaintext of only five characters. You don't give us any information about the key, but given a ciphertext of 60 characters, there are an infinite number of transformations that could turn those 60 characters into 5. Even, if I knew your transformation (encryption algorithm), there should be a large number of keys that could turn those characters into a valid 5-letter word.

Your ciphertext is very repetitive. What encoding are you using?

Developing strong cryptographic algorithms is very hard and requires experience breaking algorithms and very strong math skills in algebra, statistics, probability, linear algebra and abstract algebra as well as a working knowledge of concepts in computation and algorithm analysis. Algorithms are typically published alongside the author's own analysis in order to convince other experts that the new design is worth a look. If it appears strong/useful/interesting, other cryptographers will spend their own time trying to break the system and publish their results. If the algorithm is strong, the resulting publications will explain why the algorithm is *not* vulnerable to various attacks or what about the algorithm causes those attacks to fail.

If you want to learn more about cryptography, read this book:

http://www.amazon.com/Understanding-Cry ... 3642041000It's very accessible and doesn't assume any hard mathematical prerequisites.