hacker.org

I used a Firefox plugin called Mnenhy, which has Kenny coding/decoding builtin. It's also useful for some Base64, ROT13 and URL decoding challenges.

Fmmppffmffmpmfp pfmmmmpffpmp pfffmfpmfffp, mfpmmmpfmpfmffm mfpmmmmmfpmpmffpppmfm!

Alternatively one can use http://www.namesuppressed.com/kenny/.

first google result of "kennifier" did it. but since there is no official kenny-language, this was pure luck i guess. if you dont find the translator knox used, you will find yourself in just another substitution-challenge, which would be a real pain because its even more random than the others..

or am i missing something here?

I just solved it as a substitution cipher - it wasn't much trouble, about the same as any other short message.

It is a long time ago, but it was much more straight forward than a
substitution cipher.

I've observed, that every cleartext character is encoded in 3 characters.
And there are three different characters, so that there are 3*3*3=27
possible combinations.

Therefore I mapped m, p and f to 0, 1 and 2, calculated the base 3
numbers, and substituted the numbers with letters 0=a, 1=b, 2=c and
so on.

I only needed to find the correct mapping for m, p and f.

for me, it was almost the same. I handled it as a substitution cipher. after filling in some values, I noticed the mapping to the base 3, what confirmed that I was working correctly.

I've observed, that every cleartext character is encoded in 3 characters.

youre right. i just suspected the plain-letters may be substituted with random amounts of kenny-chars.. this would be what "pain" was referring to.