Andre,
Please download and test your strings with my cipher UDF. http://www.innotechcg.com/downloads/cipher.zip
It's a "closed source" UDF to protect the algorithms, so be sure to use either the 4.53 or 4.61 versions depending on whether you use the 4.5x or 4.6x Kix executable. If the logic returns the correct data each time, I can share the character translation part of the logic with you.
The cipher UDF is based on the German Enigma technology of WWII but mixed with some methods from early Mission:Impossible episodes and applied to computer technology. You can specify between 1 and 32768 "codewheels". The 254 possible character codes are "wrapped" around each of the wheels. (Note that zero isn't possible in Kix, so only 254 of the 255 possible codes are usable.) The characters on the wheels are aligned to the source text, then each is rotated an amount between 0 and 254 (positive or negative) based on an internal algorithm. Thus, "cat" could conceivably encipher to "rrr", making decoding based on character frequency impossible. With a single codewheel, you get a traditional Caesar code, where one character directly translates to another - easy to demonstrate but very low security (similar to ROT13). The use of more than 32 (and up to 32K) codewheels makes it extremely difficult to crack.
Anyway - this UDF had been tested and published a few years ago. The tests compared the original content and size with that which was enciphered and then deciphered. The enciphered data was the same byte-count but in display appears to have a different number of characters when non-ASCII and ASCII-Control codes are employed. I don't remember how many languages were tested, but I know it was more than just English.
Glenn
_________________________
Actually I
am a Rocket Scientist!
