攻防世界 open-sourse

1,题目

e3608d5805d7475ab82f9978116abe02.png

2,附件

附件是C代码,如下:

#include <stdio.h>
#include <string.h>

int main(int argc, char *argv[]) {
    if (argc != 4) {
    	printf("what?\n");
    	exit(1);
    }

    unsigned int first = atoi(argv[1]);
    if (first != 0xcafe) {
    	printf("you are wrong, sorry.\n");
    	exit(2);
    }

    unsigned int second = atoi(argv[2]);
    if (second % 5 == 3 || second % 17 != 8) {
    	printf("ha, you won't get it!\n");
    	exit(3);
    }

    if (strcmp("h4cky0u", argv[3])) {
    	printf("so close, dude!\n");
    	exit(4);
    }

    printf("Brr wrrr grr\n");

    unsigned int hash = first * 31337 + (second % 17) * 11 + strlen(argv[3]) - 1615810207;

    printf("Get your key: ");
    printf("%x\n", hash);
    return 0;
}

3,分析代码

#include<stdio.h>
#include <string.h>

int main(int argc, char *argv[]) {
    if (argc != 4) {
    	printf("what?\n");
    	exit(1);
    }
//如果first不是0xcafe,那么错误
    unsigned int first = atoi(argv[1]);
    if (first != 0xcafe) {               
    	printf("you are wrong, sorry.\n");
    	exit(2);
    }
//如果second对5取余为3,或者,对17取余不等于8,就说明输出错了
//那么我们取它的否命题,second对5取余不等于3,并且,对17取余等于8
//才可以满足要求
    unsigned int second = atoi(argv[2]);
if (second % 5 == 3 || second % 17 != 8) { 
    	printf("ha, you won't get it!\n");
    	exit(3);
    }

//第三部分,是h4cky0u,将输入的代码与'h4cky0u'比较,相同即符合
if (strcmp("h4cky0u", argv[3])) {
    	printf("so close, dude!\n");
    	exit(4);
    }

    printf("Brr wrrr grr\n");
//最后的输出要求,即算法是first*31337 + (由second的要求,取余的值即为8)*11 + strlen(第三个字符串)- 1615810207
    unsigned int hash = first * 31337 + (second % 17) * 11 + strlen(argv[3]) - 1615810207;
//输出函数
    printf("Get your key: ");
    printf("%x\n", hash);
    return 0;
}

4,编写解密代码

#include<stdio.h>
#include<string.h>
int main()
{
    unsigned int flag = 0xcafe*31337 + 8*11 + strlen("h4cyy0u") - 1615810207;
//结合算法写出解密算法
    printf("Get your key:");
//输出flag
    printf("%x",flag);
    return 0; 
}

5,输出即可得flag{c0ffee}

99ef4a7998cc4c79b72a7ea6f873768d.png

 

 

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值