S-AES_Python/brute_force.py at main · Loche2/S-AES_Python · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
import S_AES


class meet_in_the_middle_attack:
    def __init__(self, plaintext, cypertext):
        self.plaintext = plaintext
        self.cypertext = cypertext
        self.pairs = []

    def brute_force(self):
        """
            暴力破解
        """
        plain = self.plaintext[0]
        cyper = self.cypertext[0]
        ans = []
        for i in range(2 ** 16):
            binary_string_i = format(i, '016b')
            S1 = S_AES.S_AES(binary_string_i)
            middle_text = S1.encrypt(plain)
            ans.append([int(middle_text, 2), i])  # middletext(int) i->K1
        sorted_ans = sorted(ans, key=lambda x: x[0])
        # print(sorted_ans)
        for j in range(2 ** 16):
            binary_string_j = format(j, '016b')
            S2 = S_AES.S_AES(binary_string_j)
            middle_text = S2.decrypt(cyper)
            self.binary_search(sorted_ans, [int(middle_text, 2), j])
        for i in range(1, len(self.plaintext)):
            copy = []
            print(self.plaintext[i], self.cypertext[i])
            for j, pair in enumerate(self.pairs):
                S1 = S_AES.S_AES(pair[0])
                S2 = S_AES.S_AES(pair[1])
                if j == len(self.pairs) - 1:
                    print("ok")
                if S1.encrypt(self.plaintext[i]) == S2.decrypt(self.cypertext[i]):
                    copy.append(self.pairs[j])
                    print(S1.encrypt(self.plaintext[i]), S2.decrypt(self.cypertext[i]))
                    continue
                else:
                    continue
            self.pairs = copy
        return self.pairs

    def binary_search(self, sorted_ans, key):
        l = 0
        r = len(sorted_ans) - 1
        while (l <= r):
            mid = (int)((l + r) / 2)
            if sorted_ans[mid][0] < key[0]:
                l = mid + 1
            else:
                r = mid - 1
        if sorted_ans[l][0] == key[0]:
            # print(sorted_ans[l][0],key[0])
            # print([format(sorted_ans[l][1], '016b'),format(key[1], '016b')])
            self.pairs.append([format(sorted_ans[l][1], '016b'), format(key[1], '016b')])
        else:
            return 0
        while 1:
            l = l - 1
            if l == -1:
                break
            if sorted_ans[l][0] == key[0]:
                # print(sorted_ans[l][0],key[0])
                # print([format(sorted_ans[l][1], '016b'),format(key[1], '016b')])
                self.pairs.append([format(sorted_ans[l][1], '016b'), format(key[1], '016b')])
            else:
                break
        while (1):
            r = r + 1
            if r == len(sorted_ans):
                break
            if sorted_ans[r][0] == key[0]:
                # print(sorted_ans[r][0],key[0])
                # print([format(sorted_ans[r][1], '016b'),format(key[1], '016b')])
                self.pairs.append([format(sorted_ans[r][1], '016b'), format(key[1], '016b')])
            else:
                break


if __name__ == '__main__':
    # plain_text = ['1010101010101010', '1111000011110000']
    # cyper_text = ['1111111111111111', '0101101001011010']
    plain_text = ['1010101010101010']
    cyper_text = ['1111111111111111']
    M = meet_in_the_middle_attack(plain_text, cyper_text)
    print(M.brute_force())