-
Notifications
You must be signed in to change notification settings - Fork 1
/
fritbb_9r.cpp
225 lines (206 loc) · 4.83 KB
/
fritbb_9r.cpp
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
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
#include<iostream>
#include<ctime>
#include<stdlib.h>
using namespace std;
typedef unsigned long long UINT64;
#define nrround 9
#define testdeg 22
#define getbit(x,n) ((x>>n)&(0x1))
void Frit(int rounds);
void InitializeRC();
int checksum(int* cube, int size);
void Invcube();
UINT64 state[384] = {0};
UINT64 key[128] = {0};
UINT64 RC[32] = {0};
UINT64 temp[128] = {0};
UINT64 uconst[6]={0xAAAAAAAAAAAAAAAA,0xCCCCCCCCCCCCCCCC,0xF0F0F0F0F0F0F0F0,0xFF00FF00FF00FF00,0xFFFF0000FFFF0000,0xFFFFFFFF00000000};
int Invalist[65]={0, 1, 3, 8, 9, 10, 11, 13, 18, 19, 20, 21, 23, 29, 30, 31, 33, 39, 40, 41, 43, 46, 49, 50, 51, 53, 56, 59, 60, 61, 63, 66, 69, 70, 71, 73, 76, 79, 80, 81, 83, 86, 87, 89, 90, 91, 93, 96, 97, 99, 100, 101, 103, 106, 107, 109, 111, 113, 116, 117, 119, 121, 123, 126, 127};
int Invclist[33]={2, 4, 6, 10, 12, 18, 22, 24, 26, 28, 32, 34, 44, 46, 48, 50, 54, 56, 66, 68, 72, 76, 78, 80, 88, 90, 94, 98, 102, 110, 112, 116, 124};
int cube[22]={0,1,258,259,260,261,262,263,264,266,267,268,269,270,271,272,273,276,277,278,279,280};
int main()
{
int i = 0, j = 0;
int guesskey[128] = {0};
clock_t start, finish;
double duration;
start = clock();
InitializeRC();
srand(unsigned(time(0)));
//random key
cout << "The random key is:" << endl;
for (i = 0; i < 128; i ++)
{
if ((rand()%2) == 0)
{
key[i] = 0;
cout << 0;
}
else
{
key[i]= 0xFFFFFFFFFFFFFFFF;
cout << 1;
}
}
cout << endl;
for (i = 0; i < 128; i ++) //recover 128 bit key
{
if (checksum(cube,testdeg)==1)
guesskey[(i+1)%128] = 1;
else
guesskey[(i+1)%128] = 0;
if (guesskey[(i+1)%128] != (key[(i+1)%128]&0x1)) //check 128 bit guessed-key
{
cout << "The guessed key bit[" << (i+1)%128 << "] is wrong." << endl;
break;
}
for (j = 0; j < 2; j ++)
cube[j] = (cube[j]+1)%128;
for (j = 2; j < 22; j ++)
cube[j] = (cube[j]-256+1)%128+256;
}
if (i == 128) //The gusseed key is right
{
for (i = 0; i < 128; i ++)
cout << guesskey[i];
cout << endl;
}
finish = clock();
duration = (double)(finish - start) / CLOCKS_PER_SEC;
cout << duration << 's' << endl;
system("pause");
return 0;
}
void Frit(int n) //n-round Frit permutation
{
int i, j;
for (i = 0; i< n; i ++)
{
//sigma(a)
for (j =0; j < 128; j ++)
temp[j] = state[j] ^ state[(j+110)%128] ^ state[(j+87)%128];
for (j =0; j < 128; j ++)
state[j] = temp[j];
//c xor RC
for (j = i; j < 32; j ++)
state[352+j] ^= RC[j-i];
//c xor a&b
for (j =0; j < 128; j ++)
state[j+256] ^= state[j]&state[j+128];
//sigma(c)
for (j =0; j < 128; j ++)
temp[j] = state[j+256] ^ state[((j+118)%128)+256] ^ state[((j+88)%128)+256];
for (j =0; j < 128; j ++)
state[j+256] = temp[j];
//b = a xor b xor c
for (j =0; j < 128; j ++)
state[j+128] ^= state[j]^state[j+256];
//(a,b,c)<--(c,a,b)
for (j =0; j < 128; j ++)
{
temp[j]=state[j];
state[j]=state[j+256];
state[j+256]=state[j+128];
state[j+128]=temp[j];
}
}
}
void InitializeRC()
{
int roundconst[32]={1,1,1,1,1,0,0,1,1,0,1,0,0,1,0,0,0,0,1,0,1,0,1,1,1,0,1,1,0,0,0,1};
for (int i = 0; i < 32; i ++)
{
if (roundconst[i] == 1)
RC[i] = 0xFFFFFFFFFFFFFFFF;
else
RC[i] = 0;
}
}
void Invcube()
{
//sigma-1 a
for (int j =0; j < 128; j ++)
{
temp[j] = 0;
for (int k =0; k < 65; k ++)
temp[j] ^= state[(j+Invalist[k])%128+256];
}
for (int j =0; j < 128; j ++)
state[j+256] = temp[j];
//sigma-1 c
for (int j =0; j < 128; j ++)
{
temp[j] = 0;
for (int k =0; k < 33; k ++)
temp[j] ^= state[(j+Invclist[k])%128+256];
}
for (int j =0; j < 128; j ++)
state[j+256] = temp[j];
}
int checksum(int* index, int size)
{
UINT64 num = 1;
num = (num << size);
UINT64 j, n=0;
UINT64 sum[128]={0};
// <= 2^6 permutation
if (size <= 6)
{
for (int m = 0; m < 128; m ++)
{
state[m] = 0;
state[m+128] = key[m];
state[m+256] = 0;
}
//set cube variables
for (int q = 0; q < size; q ++)
state[index[q]] = uconst[q];
Invcube();
Frit(nrround);
for (int m = 0; m < 128; m ++)
sum[m] ^= state[m+128];
int res[128] = {0};
for (int m = 0; m < 128; m ++)
{
for(int i = 0; i < num; i ++)
res[m] ^= getbit(sum[m],i);
if(res[m] == 1)
return 1;
}
return 0;
}
// num/64 times permutation
for (j = 0;j < (num/64); j ++)
{
for (int m = 0; m < 128; m ++)
{
state[m] = 0;
state[m+128] = key[m];
state[m+256] = 0;
}
//set cube variables
for (int q = 0; q < 6; q ++)
state[index[q]] = uconst[q];
for (int q = 0; q < size-6; q ++)
{
if (getbit(j,q) == 0)
state[index[q+6]] = 0;
else
state[index[q+6]] = 0xFFFFFFFFFFFFFFFF;
}
//state256-383 inva invb
Invcube();
Frit(nrround);
for (int m = 0; m < 128; m ++)
sum[m] ^= state[m+128];
}
int res[128] = {0};
for (int m = 0; m < 128; m ++)
{
for(int i = 0; i < 64; i ++)
res[m] ^= getbit(sum[m],i);
if(res[m] == 1)
return 1;
}
return 0;
}