angstromCTF 2022 – caniride

Intro We're given a 64-bit ELF which essentially does the following: Ask for a name - this is a 49-character limit string which is stored on the stackList 4 possible "drivers" and ask for a selection (ostensibly an integer between 0-3)Print out the driver name and description (stored in an array of pointers in the… Continue reading angstromCTF 2022 – caniride


Tokyo Westerns CTF 2017 – Palindromes Pairs (Challenge Phase)

This challenge was a follow-up to an earlier challenge, titled "Palindromes Pairs - Coding Phase". In that earlier warmup ppc challenge, the goal was to write an algorithm to solve the following problem: given up to 1000 strings $latex s_i$, each of length at most 1000, count the number of pairs $latex (i, j)$ such… Continue reading Tokyo Westerns CTF 2017 – Palindromes Pairs (Challenge Phase)