-
Notifications
You must be signed in to change notification settings - Fork 0
/
decrypt.py
119 lines (96 loc) · 4.29 KB
/
decrypt.py
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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
import numpy as np
#HW = [bin(n).count("1") for n in range(0,256)]
sbox=(
0x63,0x7c,0x77,0x7b,0xf2,0x6b,0x6f,0xc5,0x30,0x01,0x67,0x2b,0xfe,0xd7,0xab,0x76,
0xca,0x82,0xc9,0x7d,0xfa,0x59,0x47,0xf0,0xad,0xd4,0xa2,0xaf,0x9c,0xa4,0x72,0xc0,
0xb7,0xfd,0x93,0x26,0x36,0x3f,0xf7,0xcc,0x34,0xa5,0xe5,0xf1,0x71,0xd8,0x31,0x15,
0x04,0xc7,0x23,0xc3,0x18,0x96,0x05,0x9a,0x07,0x12,0x80,0xe2,0xeb,0x27,0xb2,0x75,
0x09,0x83,0x2c,0x1a,0x1b,0x6e,0x5a,0xa0,0x52,0x3b,0xd6,0xb3,0x29,0xe3,0x2f,0x84,
0x53,0xd1,0x00,0xed,0x20,0xfc,0xb1,0x5b,0x6a,0xcb,0xbe,0x39,0x4a,0x4c,0x58,0xcf,
0xd0,0xef,0xaa,0xfb,0x43,0x4d,0x33,0x85,0x45,0xf9,0x02,0x7f,0x50,0x3c,0x9f,0xa8,
0x51,0xa3,0x40,0x8f,0x92,0x9d,0x38,0xf5,0xbc,0xb6,0xda,0x21,0x10,0xff,0xf3,0xd2,
0xcd,0x0c,0x13,0xec,0x5f,0x97,0x44,0x17,0xc4,0xa7,0x7e,0x3d,0x64,0x5d,0x19,0x73,
0x60,0x81,0x4f,0xdc,0x22,0x2a,0x90,0x88,0x46,0xee,0xb8,0x14,0xde,0x5e,0x0b,0xdb,
0xe0,0x32,0x3a,0x0a,0x49,0x06,0x24,0x5c,0xc2,0xd3,0xac,0x62,0x91,0x95,0xe4,0x79,
0xe7,0xc8,0x37,0x6d,0x8d,0xd5,0x4e,0xa9,0x6c,0x56,0xf4,0xea,0x65,0x7a,0xae,0x08,
0xba,0x78,0x25,0x2e,0x1c,0xa6,0xb4,0xc6,0xe8,0xdd,0x74,0x1f,0x4b,0xbd,0x8b,0x8a,
0x70,0x3e,0xb5,0x66,0x48,0x03,0xf6,0x0e,0x61,0x35,0x57,0xb9,0x86,0xc1,0x1d,0x9e,
0xe1,0xf8,0x98,0x11,0x69,0xd9,0x8e,0x94,0x9b,0x1e,0x87,0xe9,0xce,0x55,0x28,0xdf,
0x8c,0xa1,0x89,0x0d,0xbf,0xe6,0x42,0x68,0x41,0x99,0x2d,0x0f,0xb0,0x54,0xbb,0x16)
idx_calc=(0,13,10,7,4,1,14,11,8,5,2,15,12,9,6,3)
inv_idx_calc=(0,5,10,15,4,9,14,3,8,13,2,7,12,1,6,11)
def intermediate(pt, keyguess):
return sbox[int(pt) ^ keyguess]
traces = np.loadtxt('aes_tv_0000001-0005000_power.csv', delimiter=',')
pt = np.loadtxt('CIPHERTEXT10000.csv', delimiter=',')
numtraces = np.shape(traces)[0]
#numpoint = np.shape(traces)[1]
numpoint = 200
#Use less than the maximum traces by setting numtraces to something
#numtraces = 15
def HD(vn_1, vn):
diff = int(vn_1) ^ vn
#print "%x xor %x = %x, HammingDistance = %d" % (vn_1, vn, diff , bin(diff).count("1"))
return bin(diff).count("1")
bestguess = [0]*16
#Set 16 to something lower (like 1) to only go through a single subkey & save time!
for bnum in range(0, 16):
cpaoutput = [0]*256
maxcpa = [0]*256
for kguess in range(0, 256):
corr_coef = 0.0
max_corr = 0.0
print "Subkey %2d, hyp = %02x: "%(bnum, kguess),
#Initialize arrays & variables to zero
sumnum = np.zeros(numpoint)
sumden1 = np.zeros(numpoint)
sumden2 = np.zeros(numpoint)
hyp = np.zeros(numtraces)
'''
for tnum in range(0, numtraces):
hyp[tnum] = HW[intermediate(pt[tnum][bnum], kguess)]
'''
for tnum in range(0, numtraces):
'''
column = idx % 4
shift_idx = idx - 4 * column
if shift_idx < 0:
shift_idx += 16
'''
idx = idx_calc[bnum]
snum = int(pt[tnum][idx]) ^ kguess
for i in range(0,256):
if snum == sbox[i]:
leak_middle = i
break
#print "snum=%x,anum=%x" % (snum,leak_middle)
hyp[tnum] = HD(pt[tnum][bnum], leak_middle)
#Mean of hypothesis
meanh = np.mean(hyp, dtype=np.float64)
#Mean of all points in trace
meant = np.mean(traces[:,2800:3000], axis=0, dtype=np.float64)
for i in range(0, 200):
#print np.corrcoef(hyp, traces[:,(2800+i)])
corr_coef = abs(np.corrcoef(hyp, traces[:,(2800+i)])[0, 1])
if max_corr < corr_coef:
max_corr = corr_coef
maxcpa[kguess] = corr_coef
print maxcpa[kguess]
'''
#For each trace, do the following
for tnum in range(0, numtraces):
hdiff = (hyp[tnum] - meanh)
tdiff = traces[tnum,2800:3000] - meant
print tdiff.shape
sumnum = sumnum + (hdiff*tdiff)
sumden1 = sumden1 + hdiff*hdiff
sumden2 = sumden2 + tdiff*tdiff
cpaoutput[kguess] = sumnum / np.sqrt( sumden1 * sumden2 )
maxcpa[kguess] = max(abs(cpaoutput[kguess]))
print maxcpa[kguess]
'''
#Find maximum value of key
#print np.argmax(maxcpa)
bestguess[bnum] = np.argmax(maxcpa)
print "Best Key Guess: "
for subkey_i in range(len(bestguess)): print "%02x "%bestguess[inv_idx_calc[subkey_i]],