Cipher CTF Challenge Generator (NakNak - Duck - cipher )Press the blue button to regenerate a challenge. This page will generate a NakNak - Duck - cipher challenge. We convert each ASCII character to the hexacademic equivalent, and then use 0 = 'Nak', 1 = 'Nanak', 2 = 'Nananak', 3 = 'Nanananak', 4 = 'Nak?', 5 = 'nak?', 6 = 'Naknak', 7 = 'Naknaknak', 8 = 'Nak.', 9 = 'Naknak.', A (10) = 'Naknaknaknak', B (11) = 'nanak', C (12) = 'naknak', D (13) = 'nak!', E (14) = 'nak.', F (15) = 'naknaknak'. The character 'a' is "61", and so this is Naknak Nanak". |
Coding
The basic coding in C# is:
public static string toHex(string text) { return text.ToCharArray().Aggregate("", (a, b) => a + ((byte)b).ToString("X") + " ").ToLower().Trim(); } public static string getNakNak(string s) { s = s.ToLower(); string rtn = ""; string [] messages ={"Nak","Nanak","Nananak","Nanananak","Nak?","nak?","Naknak","Naknaknak","Nak.","Naknak.", "Naknaknaknak","nanak","naknak","nak!","nak.","naknaknak"}; foreach (char schar in s) { var c = toHex(schar.ToString()); foreach (char ch in c ) { if (ch >= 'a' && ch <= 'h') rtn = rtn + messages[ch - 'a' + 10] + " "; else if (ch >= '0' && ch <= '9') rtn = rtn + messages[ch - '0'] + " "; else rtn = rtn + ch; } } return (rtn); }
Example
A duck rushes in, and annouces:
Naknaknak Nak? Naknak Nak. Naknak nak? Nananak Nak Naknak Nananak Naknak naknaknak Naknak naknaknak Naknak nak! Naknaknak Nak? Naknak naknaknak Naknaknak Naknaknak Naknak nak. Nananak Nak Naknaknak Nananak Naknak Nanak Naknaknak Nak? Naknaknak Nanananak
What pop group did the duck annouce?
Well, is the NakNak (or Duck) cipher challenge. For this, we convert each ASCII character to the hexademical equivalent, and then use:
0 = 'Nak', 1 = 'Nanak', 2 = 'Nananak', 3 = 'Nanananak', 4 = 'Nak?', 5 = 'nak?', 6 = 'Naknak', 7 = 'Naknaknak', 8 = 'Nak.', 9 = 'Naknak.', A (10) = 'Naknaknaknak', B (11) = 'nanak', C (12) = 'naknak', D (13) = 'nak!', E (14) = 'nak.', F (15) = 'naknaknak'.
The character 'a' is "61" in hex, and so this is "Naknak Nanak". The coding is:
a 0x61, b 0x62, c 0x63, d 0x64, e 0x65, f 0x66, g 0x67, h 0x68, i 0x69, j 0x6A, k 0x6B, l 0x6C, m 0x6D, n 0x6E, o 0x6F, p 0x70, q 0x71, r 0x72, s 0x73, t 0x74, u 0x75, v 0x76, w 0x77, x 0x78, y 0x79, z 0x7A.
Now let's analyse:
Naknaknak Nak? 0x74 - t Naknak Nak. 0x68 - h Naknak nak? 0x65 - e Nananak Nak 0x20 -> " " Naknak Nananak 0x62-> b Naknak naknaknak 0x6F → o Naknak naknaknak 0x6F → o Naknak nak! 0x6D -> m Naknaknak Nak? t Naknak naknaknak o Naknaknak Naknaknak w Naknak nak. n Nananak Nak 20 " " Naknaknak Nananak r Naknak Nanak a Naknaknak Nak? t Naknaknak Nanananak s
The result is "the boomtown rats"