Introduction
The Kenny McCormick translator converts text into the muffled speech of Kenny McCormick from South Park. Kenny wears an orange parka with a hood that covers his mouth, so all we hear are mumbles made up of M, F, and P sounds. The Kenny cipher replaces each letter of the alphabet with a triplet of three characters chosen from M, F, and P. With 3 characters in groups of 3, there are 27 possible combinations (3 times 3 times 3), enough for the 26 letters plus a space. This tool encodes text into Kenny speech and decodes Kenny code back to readable text. Type a message, switch between encode and decode, and the result appears instantly. Everything runs in your browser.
What this tool does
- Encodes any text into Kenny McCormick's muffled speech by replacing each letter with a triplet of M, F, and P characters.
- Decodes Kenny code back to readable text by converting each three-character triplet back to its corresponding letter.
- Preserves case by using uppercase M, F, or P as the first character of each triplet for uppercase letters.
- Encodes spaces as FFF (the 27th combination) so word boundaries are preserved in the encoded output.
- Displays the full 26-letter mapping table showing which triplet corresponds to which letter, plus the space encoding.
- Validates input and reports errors for invalid triplet lengths or characters that are not M, F, or P.
How this tool works
The tool has two modes. Encode mode takes text and replaces each letter with a three-character triplet of M, F, and P. Decode mode takes Kenny code and converts each triplet back to a letter.
The encoding is a base-3 system. The three characters M, P, and F represent the digits 0, 1, and 2. Each letter's position in the alphabet (A = 0, B = 1, through Z = 25) is converted to a three-digit base-3 number, and each digit is mapped to M (0), P (1), or F (2). For example, A (position 0) is 000 in base 3, which becomes MMM. B (position 1) is 001, which becomes MMP. Z (position 25) is 221, which becomes FFP.
Space is encoded as FFF (value 26, which is 222 in base 3). This uses the 27th and final combination of the three-character triplet system.
Case is preserved by using uppercase M, P, or F as the first character of the triplet for uppercase letters. So uppercase A becomes Mmm (capital M, lowercase m, lowercase m), while lowercase a becomes mmm (all lowercase). This allows the decoder to recover the original case.
The mapping table at the bottom shows all 26 letters and their corresponding triplets, plus the space encoding, making it easy to encode or decode by hand.
How the cipher or encoding works
The Kenny cipher is a substitution cipher inspired by the character Kenny McCormick from the animated television series South Park, created by Trey Parker and Matt Stone. Kenny is famous for wearing an orange parka with a hood that covers his mouth, muffling his speech so that all the audience hears are indistinct mumbles composed of M, F, and P sounds. Despite being unintelligible to the viewer, the other characters in the show appear to understand him perfectly.
The cipher replaces each letter of the alphabet with a triplet of three characters chosen from M, F, and P. With 3 possible characters in groups of 3, there are 3 to the power of 3 = 27 possible combinations. This is enough to encode the 26 letters of the English alphabet plus one additional character (typically space).
The encoding is essentially a base-3 number system. The characters M, P, and F represent the digits 0, 1, and 2 respectively. Each letter is assigned a value based on its position in the alphabet: A = 0, B = 1, C = 2, through Z = 25. This value is then converted to a three-digit base-3 number, and each digit is replaced by its corresponding character.
For example, the letter D has position 3. In base 3, the number 3 is written as 010. Mapping each digit to its character (0 = M, 1 = P, 0 = M) gives the triplet MPM. The letter S has position 18. In base 3, 18 is 200, which maps to FMM.
The dCode website documents the Kenny cipher with the full encoding table. The particleflux/kenny GitHub project provides a command-line encoder and decoder implementation. The cipher is also documented on the asecuritysite.com cryptography reference site.
The Kenny cipher is closely related to the Bacon cipher, which uses 5-character groups of two symbols (A and B) to encode letters. The Bacon cipher has 2 to the power of 5 = 32 possible combinations, enough for 26 letters. The Kenny cipher uses 3 characters in groups of 3 instead of 2 characters in groups of 5, achieving 27 combinations with shorter groups. Both ciphers are essentially base-N encodings of letter positions.
The cipher is a monoalphabetic substitution: each letter always maps to the same triplet. This means it provides no cryptographic security. Frequency analysis breaks it easily on longer texts. The cipher is intended for entertainment and novelty, not for protecting information. It is popular among South Park fans and appears in CTF challenges and puzzle hunts as a fun encoding.
How to use this tool
- Enter your text in the input field. For encoding, type any text. For decoding, type groups of M, F, and P characters.
- Choose a mode: Encode to translate text into Kenny speech, or Decode to convert Kenny code back to text.
- Review the result. The mapping table shows which triplet corresponds to which letter.
- Click Copy to copy the result to your clipboard.
- For decoding, make sure the input length is a multiple of 3 and contains only M, F, and P characters (plus any non-MFP characters which are ignored).
Real-world examples
Encoding a famous South Park quote
A South Park fan wants to encode the phrase "Oh my God! They killed Kenny!" into Kenny's muffled speech. They type it into the Encode tab. The tool replaces each letter with its triplet: O becomes Ppf, h becomes Mfp, space becomes FFF, m becomes Ppm, y becomes Ffm, and so on. The encoded output reads "Ppfmfp FFF ppmffm Mfmppfmpm! Fmpmfpmppffm pmpmffpmfpmfmppmpm Pmpmppppppppffm!" The fan shares this with friends who can decode it using the tool.
Decoding a Kenny message
A puzzle solver receives the Kenny code "pmpmppppppppffm" and needs to decode it. They paste it into the Decode tab. The tool splits the string into triplets: pmp, mpp, ppp, ppp, ffm. Looking up each triplet in the mapping: pmp = K, mpp = E, ppp = N, ppp = N, ffm = Y. The decoded text is "KENNY". The solver recognizes the reference and moves on to the next puzzle.
Using Kenny code in a CTF challenge
A CTF participant encounters a string of M, F, and P characters in a challenge: "Mfpmpppmfpmfppf Fppppfpffpmfmpm". They recognize it as Kenny code from the pattern of three-letter groups. They paste it into the Decode tab and get "Hello World". The flag is the decoded text, and they submit it to score points.
Comparison with similar methods
| Method | Complexity | Typical use |
|---|---|---|
| Kenny cipher | 3 characters per letter, base-3 encoding, 27 combinations | South Park fandom, CTF challenges, novelty encoding |
| Bacon cipher | 5 characters per letter, base-2 encoding, 32 combinations | Steganography, historical cryptography, puzzle hunts |
| Binary encoding | 8 bits per character, base-2 encoding, 256 combinations | Computing, data representation, text encoding |
| Base64 encoding | Variable length, base-64 encoding, 64 symbols | Data transfer, email attachments, web encoding |
Limitations or considerations
The Kenny cipher is a monoalphabetic substitution with a public, fixed mapping. It provides no cryptographic security. Anyone with the triplet-to-letter table can decode any message. Frequency analysis breaks it easily on longer texts because each letter always maps to the same triplet. The cipher is intended for entertainment and novelty, not for protecting sensitive information.
The encoding triples the length of the text: each letter becomes 3 characters. A 100-character message becomes 300 characters of Kenny code. This makes the cipher inefficient for long messages.
The decoder requires the input to be a multiple of 3 characters (after stripping non-MFP characters). If the input has extra or missing characters, the tool reports an error. Non-MFP characters (punctuation, numbers, other letters) are ignored during decoding, which means they are lost in the round-trip. Only letters and spaces are preserved by the encode-then-decode cycle.
Frequently asked questions
What is the Kenny McCormick translator?
The Kenny McCormick translator converts text into the muffled speech of Kenny McCormick from South Park. Kenny wears an orange parka hood that covers his mouth, so all we hear are M, F, and P sounds. The Kenny cipher replaces each letter with a triplet of three characters chosen from M, F, and P, giving 27 possible combinations for the 26 letters plus space.
How does the Kenny cipher work?
The Kenny cipher is a base-3 encoding. The characters M, P, and F represent the digits 0, 1, and 2. Each letter's position in the alphabet (A = 0, B = 1, through Z = 25) is converted to a three-digit base-3 number, and each digit is mapped to M, P, or F. For example, A (position 0) is 000 = MMM, and Z (position 25) is 221 = FFP. Space is encoded as FFF (value 26).
Is the Kenny cipher the same as the Bacon cipher?
No, but they are related. The Bacon cipher uses 5-character groups of two symbols (A and B) to encode letters, giving 32 combinations. The Kenny cipher uses 3-character groups of three symbols (M, F, and P) to encode letters, giving 27 combinations. Both are base-N encodings of letter positions, but the Kenny cipher uses shorter groups with more symbols.
Can the Kenny cipher preserve uppercase and lowercase?
Yes. The encoding uses uppercase M, F, or P as the first character of the triplet for uppercase letters. So uppercase A becomes Mmm (capital M, lowercase m, lowercase m), while lowercase a becomes mmm (all lowercase). This allows the decoder to recover the original case of each letter.
Is the Kenny cipher secure?
No. The Kenny cipher is a monoalphabetic substitution with a public, fixed mapping. Anyone with the triplet-to-letter table can decode any message. Frequency analysis breaks it easily on longer texts. The cipher is intended for entertainment and novelty, not for protecting sensitive information.
Why does Kenny McCormick mumble in South Park?
Kenny McCormick wears an orange parka with a hood that covers his mouth, muffling his speech. The audience hears only indistinct mumbles made up of M, F, and P sounds, though the other characters in the show understand him perfectly. This is a running gag in the series, created by Trey Parker and Matt Stone. The Kenny cipher is a fan-created encoding inspired by this speech pattern.
Conclusion
The Kenny McCormick translator is a fun novelty tool that converts text into the muffled speech of South Park's most unlucky character. For other novelty and pop culture ciphers, see the Bill Cipher alphabet from Gravity Falls and the Standard Galactic Alphabet from Commander Keen. For the related Bacon cipher, see the Bacon cipher decoder. For general encoding tools, see the binary to text converter and the Base64 encoder.