GFSJ0240-【Reversing-x64Elf-100】
签到
__int64 __fastcall main(int a1, char **a2, char **a3)
{
char s[264]; // [rsp+0h] [rbp-110h] BYREF
unsigned __int64 v5; // [rsp+108h] [rbp-8h]
v5 = __readfsqword(0x28u);
printf("Enter the password: ");
if ( !fgets(s, 255, stdin) )
return 0;
if ( (unsigned int)sub_4006FD(s) )
{
puts("Incorrect password!");
return 1;
}
else
{
puts("Nice!");
return 0;
}
}
查看加密 要求每一位减去a1[i] 要 == 1 所以我们要去
__int64 __fastcall sub_4006FD(__int64 a1)
{
int i; // [rsp+14h] [rbp-24h]
_QWORD v3[4]; // [rsp+18h] [rbp-20h]
v3[0] = "Dufhbmf";
v3[1] = "pG`imos";
v3[2] = "ewUglpt";
for ( i = 0; i <= 11; ++i )
{
if ( *(char *)(v3[i % 3] + 2 * (i / 3)) - *(char *)(i + a1) != 1 )
return 1;
}
return 0;
}
exp
v3 = [0] * 3
v3[0] = "Dufhbmf"
v3[1] = "pG`imos"
v3[2] = "ewUglpt"
for i in range(12):
char = v3[i % 3][2 * (i // 3)]
print(chr(ord(char) - 1), end="")
flag
Code_Talkers
一把梭
评论