Real-time reconnaissance simulation
Field reports from the deep web
Breaking a lattice-based hash function using matrix recovery and LLL-based Short Integer Solution (SIS) attack.
Breaking a keyless custom block cipher by exploiting Python's tuple assignment semantics and XOR self-inverse properties.
Reversing recursive Haskell functions to reveal modular exponentiation, then applying Fermat's Little Theorem to recover the secret.
Recovering a corrupted 1024-bit RSA private key by factoring the modulus through public databases.
Automating decryption of a 6×6 Playfair variant with dynamic alphabet generation and socket-based server interaction.
Recovering a partially corrupted RSA prime using lattice reduction (LLL) and multivariate Coppersmith's method.
Exploiting fault injection in AES Round 9 to recover the full key via DFA and reverse key schedule.
Exploiting ring isomorphisms with Newton lifting and linear algebra over Z_{2^k} to recover secret polynomial evaluations.
Recovering the GHASH authentication key via nonce reuse and counter mismanagement to forge admin tokens.
Implementing Schnorr's SIGMA protocol to prove knowledge of a discrete log without revealing the secret.