BronoCTF Forensics Challenge Solved by Spotting Outlier File in 333-File Maze
A BronoCTF forensics challenge presented participants with a ZIP archive containing 333 mostly empty decoy files spread across a deeply nested directory tree. The goal was to locate and reconstruct a hidden flag from 50 sequentially named fragment files (.part_00 through .part_49) buried among the noise. Sorting all extracted files by size revealed a hidden Python script, .solver.py, as a clear statistical outlier at 906 bytes while every other file was under 62 bytes. The script's own docstring explained the reconstruction method, and running it concatenated the 50 parts in order to produce the flag. The challenge highlighted practical forensic techniques: sorting by file size to find anomalies and paying close attention to dot-prefixed hidden files.
This is an AI-generated summary. ShortSingh links to the original source for the complete article.
Discussion (0)
Log in to join the discussion and vote.
Log in