Friday Mini CTF

    Greetings to all habrachitateli. I really like to stretch my brains with different tasks - it can be some kind of mathematical problems, interesting puzzles related to programming, or some ctf tasks.

    For those who want to diversify Friday with puzzles, I want to offer my own mini-ctf, in which there are only three tasks.

    XT_CTF_01

    XT_TASK_101

    Link to a task: xt_task_101.zip
    Flag Format: XTGFLAG {...}
    the SHA1 flag: 6980D76C3C5246A101820A77031CA0EBE84A4A0E

    XT_TASK_102

    Link to a task: xt_task_102.zip
    Flag Format: XT {...}
    the SHA1 flag: 16448BF22750DE7E575A5A86E739FA9018ACFE52

    XT_QUEST_103

    Link to a task:xt_quest_103.zip
    Number of levels: 15 + bonus

    Each file is a separate task (well, or in the case of 3 tasks - a quest), they are not interconnected. The goal of the first two is to get a flag whose format is specified. As an additional check, I indicated flag hashes so that you can easily check whether you solved the problem correctly or not. The quest consists of 15.5 consecutive tasks, where a new one opens after solving the previous one, the answer to the current task is the password from the archive with the next one, so a separate hash is not required for verification.

    In tasks there are no executable files, dependencies on some external services. You can use anything you want - Google, online services, your favorite programming languages.

    I assess the complexity of tasks as medium for tasks and easy for quests. It would be great if commentators refrain from prompting in the comments (or at least hide them under a spoiler) so as not to spoil the decision process for those who will decide later.

    A page on github , if anyone is easier to save a bookmark there.

    Also popular now: