buuctf-re三道

最新推荐文章于 2024-04-14 23:48:50 发布

woy66

最新推荐文章于 2024-04-14 23:48:50 发布

阅读量380

点赞数

本文链接：https://blog.csdn.net/qq_41173457/article/details/117484780

版权

本文详细介绍了三个CTF逆向挑战，包括[WUSTCTF2020]的level1和level2，以及[GWCTF 2019]的xxor题目。通过IDA分析，解析了程序的验证函数和加密运算过程，涉及异或操作和数组运算。提供了解题思路和逆向工程的详细步骤。

摘要由CSDN通过智能技术生成

buuctf-re三道

原创 a3uRa 一个小红客a3uRa 今天

[WUSTCTF2020]level1 👌
[WUSTCTF2020]level2 👌
[GWCTF 2019]xxor 👌 详解✨

[WUSTCTF2020]level1 👌

https://www.cnblogs.com/Mayfly-nymph/p/12885667.html

https://blog.csdn.net/weixin_47158947/article/details/107821211

int __cdecl main(int argc, const char **argv, const char **envp)
{
  FILE *stream; // ST08_8
  signed int i; // [rsp+4h] [rbp-2Ch]
  char ptr[24]; // [rsp+10h] [rbp-20h]
  unsigned __int64 v7; // [rsp+28h] [rbp-8h]

  v7 = __readfsqword(0x28u);
  stream = fopen("flag", "r");
  fread(ptr, 1uLL, 0x14uLL, stream);
  fclose(stream);
  for ( i = 1; i <= 19; ++i )
  {
    if ( i & 1 )
      printf("%ld\n", (unsigned int)(ptr[i] << i));
    else
      printf("%ld\n", (unsigned int)(i * ptr[i]));
  }
  return 0;
}

a = [198,232,816,200,1536,300,6144,984,51200,570,92160,1200,565248,756,1474560,800,6291456,1782,65536000]
flag = ''

for i in range(19):
	# print i+1
	if (i+1)&1:
		flag += chr(a[i] >> (i+1))
	else:
		flag += chr(a[i]//(i+1))
print flag