本文主要是介绍攻防世界---Reversing-x64Elf-100,希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!
1.下载附件,先查壳,无壳
2.用IDA分析,找到main函数,使用fn+f5,反编译
3.分析代码
4.双击进入条件函数中查看代码
5.编写代码,来源:https://blog.csdn.net/2303_80796023/article/details/137086655?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522171324225816800213098524%2522%252C%2522scm%2522%253A%252220140713.130102334..%2522%257D&request_id=171324225816800213098524&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~sobaiduend~default-1-137086655-null-null.142^v100^pc_search_result_base5&utm_term=%E6%94%BB%E9%98%B2%E4%B8%96%E7%95%8CReversing-x64Elf-100&spm=1018.2226.3001.4187https://blog.csdn.net/2303_80796023/article/details/137086655?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522171324225816800213098524%2522%252C%2522scm%2522%253A%252220140713.130102334..%2522%257D&request_id=171324225816800213098524&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~sobaiduend~default-1-137086655-null-null.142^v100^pc_search_result_base5&utm_term=%E6%94%BB%E9%98%B2%E4%B8%96%E7%95%8CReversing-x64Elf-100&spm=1018.2226.3001.4187
#include<stdio.h>
int main() {
char str1[] = "Dufhbmf";
char str2[] = "pG`imos"; //拆成三个数组,str1,str2,str3
char str3[] = "ewUglpt";
char result;
for (int i = 0; i <= 11; i++) {
if (i % 3 == 0) {
result = str1[2 * (i / 3)] - 1;
}
else if (i % 3 == 1) {
result = str2[2 * (i / 3)] - 1;
}
else {
result = str3[2 * (i / 3)] - 1;
}
printf("%c", result);
}
return 0;
}
6.运行得flag
Code_Talkers
这篇关于攻防世界---Reversing-x64Elf-100的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!