Our team, m01nm01n got 5th place among 668 teams in Diver OSINT CTF 2025. m01nm01n is a CTF team of National Institute of Technology, Kisarazu College. moinmoin image introduction bx

by m01nm01n preface ranking category rank global 15th

sanity-check (100 pts) - 1245 solves Description Welcome to ImaginaryCTF 2024! Attachments ictf{this_isnt_real} discord (100 pts) - 1027 solves https://canary.discord.com/channels/732308165265326080/1262522411123736718/1262528560904667239 ictf{fake_flag_for_testing}

Preface AlpacaHack Round8: https://alpacahack.com/ctfs/round-8 :::info quote Welcome to AlpacaHack Round 8 (Rev)! AlpacaHack is a new platform that hosts individual CTF competitions. AlpacaHack Round 8 is the 8th CTF hosted by the AlpacaHack team, featuring 4 Rev challenges. The challenges are designed with a wide range of difficulties, making them enjoyable for participants of all levels, including beginners. These challenges are created by arata-nvm and sugi! :::

CTFのリバーシングを解いていると,条件に当てはまる入力を探索することが有ります. フラグに関する条件を入れて探索してくれるのがSMTソルバ(z3)です. z3はリバーシングの分野で頻出で,パターンの解を見つけるのにもz3,数式を解くにもz3などかなり便利ですが今まで真面目に触れてこなかったので一通り触ってみたいと思いました. https://gmo-cybersecurity.com/blog/flare-on-11-write-up-ja/ https://gmo-cybersecurity.com/blog/flare-on-11-write-up/ GMOサイバーセキュリティbyイエラエの記事,"The Flare-On Challengeとは？Flare-On 11の問題紹介とFlare-On 12への誘い"ではz3を使ってリバーシングの有名なCTFであるThe Flare-On Challengeの問題を解いています. Yaraルールに関する制約を満たす解をz3で見つけています. https://apemik.hatenablog.com/entry/2024/10/05/215345

analysis 0000128f int64_t vuln() 0000129b void* fsbase 0000129b int64_t rax = *(fsbase + 0x28) 000012b4 puts(str: "--- I'll repeat what you say :D …") 000012ca void buf 000012ca memset(&buf, 0, 0xa) 000012e5 ssize_t var_28 = read(fd: 0, buf: &buf, nbytes: 0x64) 000012ff printf(format: "You said: %s\n", &buf)

summary SUSHI1st 32nd place screencapture-ctf-n00bzunit3d-xyz-user-2024-08-05-09_59_54 rev Vacation chall $bytes = [System.Text.Encoding]::ASCII.GetBytes((cat .\flag.txt)) [System.Collections.Generic.List[byte]]$newBytes = @()

pwn-Function Pairing from pwn import * e = ELF("vuln") libc = ELF("/usr/lib/x86_64-linux-gnu/libc.so.6") context.binary = e #p = e.process() p = remote("litctf.org",31774)

chall #include <cstdlib> #include <iostream> #include <string> #include <vector> char buf[16]; std::vector<char> v = {'X', 'X', 'X', 'X', 'X'}; void lose() {

Crypt X Marked the Spot Easy,XOR Encryption. Challenge from itertools import cycle flag = b"uiuctf{????????????????????????????????????????}" # len(flag) = 48

OvewView team NITKCで出場し、1416ptで28th/962teamsでした。 image crypto (by chizuchizu) Safe Prime $p$と$q$と$n$の関係を上手くほどいてやると解ける。 $$n=pq=p(2p+1)=2p^2+p$$