Favourite teams from different CTF-contests take part in contest, also teams who developed some contests participated - totally 21 teams.
One task with 3 difficulty levels was suggested. With increasing the difficulty level, obfuscation complexity and unpacking algorithm complexity increases. Each participant obtains unique obfuscated server elf-file. In elf-file shellcode is unpacked and run. Participant must reverse the algorithm of packing. obtain the shellcode and apply it.
As the result 7 solutions of first difficulty level and 3 solutions of second difficulty level was passed. Third level was unsolved.
Favourite teams from different CTF-contests take part in contest, also teams who developed some contests participated - totally 20 teams.
1 task was proposed with obfuscation levels 1 (without obfuscation), 2, 3, 6, 20. To solve a task participant must find argument string which leads to program prints Ok. Finite state automata was coded in task (new per download) and argument string must transfer it to accepting state. The task was facilitated by the fact that a string of only 10 characters was required.
At the result only 2 teams solved this tasks. One of them solved task using bruteforce of input strings to reconstruct structure of automaton using very powerful computer. As there is almost no slowdown of obfuscated programs, they solved 5 levels. Another team solved this task using reverse-engineering and 4 levels was solved.