BUUCTF Reverse刷题笔记04——[GXYCTF2019]luck_guy

一、拉入ExeinfoPe分析

二、拉入64位IDA分析

进入main函数，F5查看伪代码

// local variable allocation has failed, the output may be wrong!
int __cdecl main(int argc, const char **argv, const char **envp)
{
  int v4; // [rsp+14h] [rbp-Ch]
  unsigned __int64 v5; // [rsp+18h] [rbp-8h]

  v5 = __readfsqword(0x28u);
  welcome(*(_QWORD *)&argc, argv, envp);
  puts("_________________");
  puts("try to patch me and find flag");
  v4 = 0;
  puts("please input a lucky number");
  __isoc99_scanf((__int64)"%d", (__int64)&v4);
  patch_me(v4);
  puts("OK,see you again");
  return 0;
}

分析代码可以大致推出，让我们输入一个flag，保存到v4中，然后通过 patch_me(v4)进行操作，所有我们跟进 patch_me(v4);

int __fastcall patch_me(int a1)
{
  int result; // eax

  if ( a1 % 2 == 1 )
    result = puts("just finished");
  else
    result = get_flag();
  return result;
}

第一眼便看到了可疑函数，我们直接进入 get_flag()中查看

unsigned __int64 get_flag()
{
  unsigned int v0; // eax
  char v1; // al
  signed int i; // [rsp+4h] [rbp-3Ch]
  signed int j; // [rsp+8h] [rbp-38h]
  __int64 s; // [rsp+10h] [rbp-30h]
  char v6; // [rsp+18h] [rbp-28h]
  unsigned __int64 v7; // [rsp+38h] [rbp-8h]

  v7 = __readfsqword(0x28u);
  v0 = time(0LL);
  srand(v0);
  for ( i = 0; i <= 4; ++i )
  {
    switch ( rand() % 200 )
    {
      case 1:
        puts("OK, it's flag:");
        memset(&s, 0, 0x28uLL);
        strcat((char *)&s, f1);
        strcat((char *)&s, &f2);
        printf("%s", &s);
        break;
      case 2:
        printf("Solar not like you");
        break;
      case 3:
        printf("Solar want a girlfriend");
        break;
      case 4:
        v6 = 0;
        s = 9180147350284624745LL;
        strcat(&f2, (const char *)&s);
        break;
      case 5:
        for ( j = 0; j <= 7; ++j )
        {
          if ( j % 2 == 1 )
            v1 = *(&f2 + j) - 2;
          else
            v1 = *(&f2 + j) - 1;
          *(&f2 + j) = v1;
        }
        break;
      default:
        puts("emmm,you can't find flag 23333");
        break;
    }
  }
  return __readfsqword(0x28u) ^ v7;
}

分段分析代码

  v7 = __readfsqword(0x28u);
  v0 = time(0LL);                               // 获取时间
  srand(v0);                                    // 用时间作为种子来生成随机数
  for ( i = 0; i <= 4; ++i )
  {
    switch ( rand() % 200 )                     // 生成随机数0~199
    {

case 1：

      case 1:
        puts("OK, it's flag:");
        memset(&s, 0, 0x28uLL);
        strcat((char *)&s, f1);               //f1 = 'GXY{do_not_'
        strcat((char *)&s, &f2);              //f2初始默认为空
        printf("%s", &s);                     //s = f1 + f2
        break;

由case 1差不多可以推出，最终的s保存的即为正确flag

case 2与case 3 都是输出语句，接着看case4

case 4：

        case 4:
        v6 = 0;
        s = 9180147350284624745LL;
        strcat(&f2, (const char *)&s);        //将s保存到f2中
        break;

case 5：

      case 5:
        for ( j = 0; j <= 7; ++j )
        {
          if ( j % 2 == 1 )
            v1 = *(&f2 + j) - 2;
          else
            v1 = *(&f2 + j) - 1;
          *(&f2 + j) = v1;
        }
        break;

case 5是对f2进行操作

由上面分析可以得出，随机产生的数往下走，只有正确的经过case 4，再经过case 5对f2进行操作，最后由case 1输出才能得到正确的flag

编写脚本

f1 = 'GXY{do_not_'
str = "fo`guci"
str = str[::-1]
flag = ""
for i in range(len(str)):
    if(i % 2 == 1):
        flag += chr(ord(str[i]) - 2)
    else:
        flag += chr(ord(str[i]) - 1)
f1+=flag
print(f1)

运行得到
按照题目要求包上flag上交即可