sightseeing-in-ghent
OSINT adventure in Ghent requiring landmark identification, Google Maps investigation, and decoding a hidden sequence from a YouTube video soundtrack.
2023 13 writeups
OSINT adventure in Ghent requiring landmark identification, Google Maps investigation, and decoding a hidden sequence from a YouTube video soundtrack.
Advanced RSA attack exploiting MSB leaks from CRT exponents. Uses the Coppersmith method and lattice-based reduction to factor large moduli.
Deep dive into Nim-specific CRLF injection (CVE-2020-15693). Shows how to inject JSON payloads into headers to bypass frontend filters and achieve SQL injection.
Multi-stage web exploitation involving a ReDoS-powered race condition, OAuth2-based XSS for token theft, and a final RCE via HTML2PDF font abuse.
High-level Cryptography solve demonstrating the Invalid Curve Attack. Explains how to recover a secret key by sending points from curves with lower orders.
Classic cryptography overview featuring Caesar and Vigenere Ciphers. Demonstrates single-byte XOR bruteforcing and frequency analysis for multi-key XOR decryption.
Comprehensive walkthrough of three RSA challenges from CTF101, covering basic decryption, factoring using online tools, and exploiting totient multiples from leaked private exponents.
Step-by-step guide to reversing complex data encodings. Covers nested Base64/Base16 loops and a custom bit-shifting 'magic shuffle' algorithm.
OSINT challenge solve involving Leuven landmark recognition, Google Maps review scouting, and a creative hex-to-ASCII video transcription puzzle.
Hands-on tutorial on manipulating HTTP headers using curl. Demonstrates how to bypass server-side checks for User-Agent, Referer, and custom headers.
Detailed exploration of Path Traversal vulnerabilities. Explains how to bypass non-recursive traversal filters by nesting sequences to reach sensitive system files.
Introduction to the security.txt standard (RFC 9116). Shows how to locate and use a site's security policy to find hidden contact information and flags.
RSA factoring challenge using specific linear combination hints. Employs a brute-force GCD attack on coprime hint coefficients to recover the private key.