BUUCTF-Java逆向解密-reverse

最新推荐文章于 2024-01-03 15:02:29 发布

liangliang0107

最新推荐文章于 2024-01-03 15:02:29 发布

阅读量614

点赞数

文章标签： c++ javascript

本文链接：https://blog.csdn.net/hu060107/article/details/129643137

版权

BUUCTF Java逆向解密 -reverse

package defpackage;

import java.util.ArrayList;
import java.util.Scanner;

/* renamed from: Reverse  reason: default package */
/* loaded from: Reverse.class */
public class Reverse {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        System.out.println("Please input the flag ：");
        String str = s.next();
        System.out.println("Your input is ：");
        System.out.println(str);
        char[] stringArr = str.toCharArray();
        Encrypt(stringArr);
    }

    public static void Encrypt(char[] arr) {
        ArrayList<Integer> Resultlist = new ArrayList<>();
        for (char c : arr) {
            int result = (c + '@') ^ 32;
            Resultlist.add(Integer.valueOf(result));
        }
        int[] KEY = {180, 136, 137, 147, 191, 137, 147, 191, 148, 136, 133, 191, 134, 140, 129, 135, 191, 65};
        ArrayList<Integer> KEYList = new ArrayList<>();
        for (int i : KEY) {
            KEYList.add(Integer.valueOf(i));
        }
        System.out.println("Result:");
        if (Resultlist.equals(KEYList)) {
            System.out.println("Congratulations！");
        } else {
            System.err.println("Error！");
        }
    }
}

使用jadx打开文件浏览下代码发现关键代码

    public static void Encrypt(char[] arr) {
        ArrayList<Integer> Resultlist = new ArrayList<>();
        for (char c : arr) {
            int result = (c + '@') ^ 32;
            Resultlist.add(Integer.valueOf(result));
        }
        int[] KEY = {180, 136, 137, 147, 191, 137, 147, 191, 148, 136, 133, 191, 134, 140, 129, 135, 191, 65};
        ArrayList<Integer> KEYList = new ArrayList<>();
        for (int i : KEY) {
            KEYList.add(Integer.valueOf(i));
        }
        System.out.println("Result:");
        if (Resultlist.equals(KEYList)) {
            System.out.println("Congratulations！");
        } else {
            System.err.println("Error！");
        }
    }

1. 第一个for循环是将用户输入的内容的ASCII码加上`@`的ASCII码然后进行异或加密存放到 `Resultlist`

2. 第二个for循环是将 KEY中的每一个元素存放到 KEYList

3. `Resultlist.equals(KEYList)` Resultlist是否等于KEYList

还原原数据

1. 获取key中的每一个元素与32进行异或加密

2. 加密后再减去 `@`的ASCII码（64）;

C语言实现

#include <stdio.h>
int main(int argc, char const *argv[])
{
    char key[] = {180, 136, 137, 147, 191, 137, 147, 191, 148, 136, 133, 191, 134, 140, 129, 135, 191, 65};
    char flag[18];
    for (int i = 0; i < sizeof(key); i++)
    {
        flag[i] = (key[i] ^ 32) - 64;
    }
    printf("%s", flag);
    return 0;
}

JavaScript实现

let key = [180, 136, 137, 147, 191, 137, 147, 191, 148, 136, 133, 191, 134, 140, 129, 135, 191, 65];
let flag = ""
for (let i = 0; i < key.length; i++) {
    flag += String.fromCharCode((key[i] ^ 32) - 64);
}