Comments for BabyPhD CTF Team https://babyphd.net Nói chung đây là một khái niệm vô cùng trừu tượng Thu, 27 Jul 2017 19:02:33 +0000 hourly 1 https://wordpress.org/?v=5.2.2 Comment on hackyou.ctf.su 2016 by justcallmedude https://babyphd.net/2016/11/24/hackyou-ctf-su-2016/#comment-8120 Thu, 27 Jul 2017 13:39:55 +0000 https://babyphd.net/?p=627#comment-8120 nice, I'll try KLEE next time 😀

]]>
Comment on hackyou.ctf.su 2016 by zun https://babyphd.net/2016/11/24/hackyou-ctf-su-2016/#comment-7474 Mon, 26 Dec 2016 07:42:40 +0000 https://babyphd.net/?p=627#comment-7474 in [Reverse 100] problem, other simple way is to use Klee to solve

#include
#include
#include

#define ITERS 12
int main() {
char buf[ITERS];
klee_make_symbolic(buf, ITERS, "012345");
unsigned int a = buf[0] | (buf[4] << 8) | (buf[8] << 16);
unsigned int b = buf[1] | (buf[5] << 8) | (buf[9] << 16);
unsigned int c = buf[2] | (buf[6] << 8) | (buf[10] << 16);
unsigned int d = buf[3] | (buf[7] << 8) | (buf[11] << 16);
if (!(((a % 3571) == 2963) && (((a % 2843) == 215)) && (((a % 30243) == 13059))))
return 2;
if (!(((b % 80735) == 51964) && (((b % 8681) == 2552)) && (((b % 40624) == 30931))))
return 3;
if (!(((c % 99892) == 92228) && (((c % 45629) == 1080)) && (((c % 24497) == 12651))))
return 4;
if (!(((d % 54750) == 26981) && (((d % 99627) == 79040)) && (((d % 84339) == 77510))))
return 5;
// printf("Congratulations %s is flag\n",buf);
klee_assert(0);
return 0;
}

]]>
Comment on Writeup for beginners - BoF Vulnerability Lab (Syracuse University) by Tony https://babyphd.net/2016/03/12/writeup-for-beginners-bof-vulnerability-lab-syracuse-university/#comment-7218 Fri, 25 Nov 2016 01:43:02 +0000 https://babyphd.net/?p=486#comment-7218 In the first example, if you don't put the NOPs before the shellcode (for instance if you write the shellcode and then the NOPs) the exploit does not work. Can you explain why are the NOPs required in that place?

]]>
Comment on Whitehat Contest 12 - Pwn400 by john https://babyphd.net/2016/09/11/whitehat-contest-11-pwn400/#comment-7211 Fri, 07 Oct 2016 04:02:00 +0000 https://babyphd.net/?p=600#comment-7211 alert('>"<')

Awesome bug @_@

]]>
Comment on Whitehat Contest 12 - Pwn400 by chuymichxinhdep https://babyphd.net/2016/09/11/whitehat-contest-11-pwn400/#comment-7210 Mon, 12 Sep 2016 03:45:24 +0000 https://babyphd.net/?p=600#comment-7210 Shame on youu :shame:

]]>
Comment on [Whitehat GrandPrix 2015] Writeup by sn https://babyphd.net/2015/10/28/whitehat-grandprix-2015-writeup/#comment-7208 Sun, 15 Nov 2015 11:38:47 +0000 https://babyphd.net/?p=367#comment-7208 How to solve crypto-100?

]]>
Comment on [Whitehat GrandPrix 2015] Writeup by chuymichxinhdep https://babyphd.net/2015/10/28/whitehat-grandprix-2015-writeup/#comment-7206 Fri, 30 Oct 2015 12:47:14 +0000 https://babyphd.net/?p=367#comment-7206 Oh thiệt là ghê

]]>
Comment on CSAW 2015 CTF All Exploitable Solutions (Script only) by Tuấn https://babyphd.net/2015/09/21/csaw-2015-ctf-all-exploitable-solutions-script-only/#comment-6858 Sun, 04 Oct 2015 07:35:14 +0000 https://babyphd.net/?p=359#comment-6858 http://dctf.def.camp/ giúp đỡ xíu đc ko ad @@

]]>
Comment on BackdoorCTF Writeup by Khoa https://babyphd.net/2015/04/03/backdoorctf-writeup/#comment-3449 Mon, 06 Apr 2015 09:05:07 +0000 https://babyphd.net/?p=324#comment-3449 Trong câu MISC của backdoor CTF 2015: QR. Cho mình hỏi nhiệm vụ của 2 đoạn code này. Cảm ơn 🙂
1 - string = string+line[1:len(line)-1]+"0"*(47-len(line))+"\n"
2 - file.write(string[46:len(string)-1-46])

]]>
Comment on [Whitehat Contest 8] Pwn200,Pwn500 Writeup by justcallmedude https://babyphd.net/2015/02/01/whitehat-contest-8-pwn200pwn500-writeup/#comment-19 Mon, 02 Feb 2015 15:17:25 +0000 https://babyphd.net/?p=288#comment-19 so funny, bro =)))

]]>