زمان مطالعه: 2دقیقه In this challenge, we have access to an img file.As usual for most forensic challenges, I’ll use binwalk with some extra options: This will recursively extract all known and unknown files inside the Img file: This will directly give us the second part of the flag: As shown in binwalk output, there is a KGB
زمان مطالعه: < 1دقیقه We have access to source code of this challenge: In order to find the value of flag, we have to send two variables named first and second. first and second should have equal length, be diferent, and the hashed value of salt+first should be equal to salt+second. So what is required is to send the
زمان مطالعه: 3دقیقه Below is the writeup for a programming challenge in SuSec CTF 2020.The source code is given as follow: Basically all the operation is happening in idle_square funcion. In 40 rounds, the chosen x (which we have to find its value) will first get XOR-ed by a constant (pad) and then is powered by 2 in
