+/Cryptopals

git clone https://git.julia.blue/+/Cryptopals

Joseph RyanAdd rust solutions6d42c13

master
2.2 KiB78 linesraw
1import base64, binascii
2
3b642hex = lambda s: binascii.hexlify(base64.b64decode(s))
4
5ascii2b = lambda s: bytes([ord(i) for i in s])
6
7b2hex = lambda b: binascii.hexlify(b)
8
9hex2b = lambda s: bytes([int(s[i : i + 2], 16) for i in range(0, len(s), 2)])
10
11fixedXor = lambda a, b: bytes([a[i] ^ b[i] for i in range(len(a))])
12
13singleCharXor = lambda s, c: bytes([s[i] ^ c for i in range(len(s))])
14
15printable = lambda s: not (False in [31 < i < 127 or i == 10 or i == 13 for i in s])
16
17
18def xorCipher(s):
19    # fmt: off
20    englishLetters = [
21        8.167, 1.492, 2.782, 4.253, 12.702, 2.228, 2.015, 6.094, 6.966,
22        0.153, 0.772, 4.025, 2.406, 6.749, 7.507, 1.929, 0.095, 5.987,
23        6.327, 9.056, 2.758, 0.978, 2.360, 0.150, 1.975, 0.074,
24    ]  # fmt: on
25    space = 18.31
26    b = hex2b(s)
27    bestMatch = ""
28    bestScore = 0
29    key = 0
30    for i in range(255):
31        currentStr = binascii.unhexlify(b2hex(singleCharXor(b, i)))
32        if printable(currentStr):
33            score = 0
34            temp = currentStr.lower()
35            for c in temp:
36                if 96 < c < 123:
37                    score += englishLetters[c - 97]
38                elif c == 32:
39                    score += space
40            if score > bestScore:
41                bestScore = score
42                bestMatch = currentStr
43                key = i
44    return bestMatch, bestScore, key
45
46
47def decodeRepeatingXor(s, k):
48    while len(k) < len(s):
49        k += k
50    return binascii.unhexlify(b2hex(fixedXor(hex2b(s), ascii2b(k))))
51
52
53hamDist = lambda a, b: sum([bin(i).count("1") for i in fixedXor(a, b)])
54
55f = open("input_data/6.txt")
56data = hex2b(b642hex(f.read()))
57f.close()
58keySizes = []
59for i in range(2, 40):
60    dist = []
61    for j in range(len(data) // 40):
62        dist.append(
63            hamDist(data[j * i : (j + 1) * i], data[(j + 1) * i : (j + 2) * i])
64            / float(i)
65        )
66    avgDist = sum(dist) / len(dist)
67    keySizes.append((avgDist, i))
68keySizes.sort()
69
70for n in range(3):
71    key = []
72    keySize = keySizes[n][1]
73    blocks = [data[i::keySize] for i in range(keySize)]
74    for b in blocks:
75        key.append(xorCipher(b2hex(b))[2])
76    key = "".join([chr(i) for i in key])
77    if printable(key[0].encode()):
78        print(decodeRepeatingXor(b2hex(data), key).decode())