-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathpyjamask.c
More file actions
executable file
·382 lines (303 loc) · 10.3 KB
/
Copy pathpyjamask.c
File metadata and controls
executable file
·382 lines (303 loc) · 10.3 KB
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
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
/*
===============================================================================
Reference implementation of Pyjamask block ciphers in C
Copyright (C) 2019 Dahmun Goudarzi, Jérémy Jean, Stefan Kölbl,
Thomas Peyrin, Matthieu Rivain, Yu Sasaki, Siang Meng Sim
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.
===============================================================================
*/
#include <stdint.h>
//==============================================================================
//=== Parameters
//==============================================================================
#define STATE_SIZE_96 3
#define STATE_SIZE_128 4
#define NB_ROUNDS_96 14
#define NB_ROUNDS_128 14
#define NB_ROUNDS_KS 14
//==============================================================================
//=== Macros
//==============================================================================
#define right_rotate(row) \
row = (row >> 1) | (row << 31);
#define left_rotate(row,n) \
row = (row >> n) | (row << (32-n));
//==============================================================================
//=== Constants
//==============================================================================
#define COL_M0 0xa3861085
#define COL_M1 0x63417021
#define COL_M2 0x692cf280
#define COL_M3 0x48a54813
#define COL_MK 0xb881b9ca
#define COL_INV_M0 0x2037a121
#define COL_INV_M1 0x108ff2a0
#define COL_INV_M2 0x9054d8c0
#define COL_INV_M3 0x3354b117
#define KS_CONSTANT_0 0x00000080
#define KS_CONSTANT_1 0x00006a00
#define KS_CONSTANT_2 0x003f0000
#define KS_CONSTANT_3 0x24000000
#define KS_ROT_GAP1 8
#define KS_ROT_GAP2 15
#define KS_ROT_GAP3 18
//==============================================================================
//=== Common functions
//==============================================================================
void load_state(const uint8_t *plaintext, uint32_t *state, int state_size)
{
int i;
for (i=0; i<state_size; i++)
{
state[i] = plaintext[4*i+0];
state[i] = (state[i] << 8) | plaintext[4*i+1];
state[i] = (state[i] << 8) | plaintext[4*i+2];
state[i] = (state[i] << 8) | plaintext[4*i+3];
}
}
void unload_state(uint8_t *ciphertext, const uint32_t *state, int state_size)
{
int i;
for (i=0; i<state_size; i++)
{
ciphertext [4*i+0] = (uint8_t) (state[i] >> 24);
ciphertext [4*i+1] = (uint8_t) (state[i] >> 16);
ciphertext [4*i+2] = (uint8_t) (state[i] >> 8);
ciphertext [4*i+3] = (uint8_t) (state[i] >> 0);
}
}
uint32_t mat_mult(uint32_t mat_col, uint32_t vec)
{
int i;
uint32_t mask, res=0;
for (i = 31; i>=0; i--)
{
mask = -((vec >> i) & 1);
res ^= mask & mat_col;
right_rotate(mat_col);
}
return res;
}
//==============================================================================
//=== Key schedule
//==============================================================================
void ks_mix_comlumns(const uint32_t *ks_prev, uint32_t *ks_next)
{
uint32_t tmp;
tmp = ks_prev[0] ^ ks_prev[1] ^ ks_prev[2] ^ ks_prev[3];
ks_next[0] = ks_prev[0] ^ tmp;
ks_next[1] = ks_prev[1] ^ tmp;
ks_next[2] = ks_prev[2] ^ tmp;
ks_next[3] = ks_prev[3] ^ tmp;
}
void ks_mix_rotate_rows(uint32_t *ks_state)
{
ks_state[0] = mat_mult(COL_MK, ks_state[0]);
left_rotate(ks_state[1],KS_ROT_GAP1)
left_rotate(ks_state[2],KS_ROT_GAP2)
left_rotate(ks_state[3],KS_ROT_GAP3)
}
void ks_add_constant(uint32_t *ks_state, const uint32_t ctr)
{
ks_state[0] ^= KS_CONSTANT_0 ^ ctr;
ks_state[1] ^= KS_CONSTANT_1;
ks_state[2] ^= KS_CONSTANT_2;
ks_state[3] ^= KS_CONSTANT_3;
}
void key_schedule(const uint8_t *key, uint32_t* round_keys)
{
int r;
uint32_t *ks_state = round_keys;
load_state(key, ks_state, 4);
for (r=0; r<NB_ROUNDS_KS; r++)
{
ks_state += 4;
ks_mix_comlumns(ks_state-4, ks_state);
ks_mix_rotate_rows(ks_state);
ks_add_constant(ks_state,r);
}
}
//==============================================================================
//=== Pyjamask-96 (encryption)
//==============================================================================
void mix_rows_96(uint32_t *state)
{
state[0] = mat_mult(COL_M0, state[0]);
state[1] = mat_mult(COL_M1, state[1]);
state[2] = mat_mult(COL_M2, state[2]);
}
void sub_bytes_96(uint32_t *state)
{
state[0] ^= state[1];
state[1] ^= state[2];
state[2] ^= state[0] & state[1];
state[0] ^= state[1] & state[2];
state[1] ^= state[0] & state[2];
state[2] ^= state[0];
state[0] ^= state[1];
state[2] = ~state[2];
// swap state[0] <-> state[1]
state[0] ^= state[1];
state[1] ^= state[0];
state[0] ^= state[1];
}
void add_round_key_96(uint32_t *state, const uint32_t *round_key, int r)
{
state[0] ^= round_key[4*r+0];
state[1] ^= round_key[4*r+1];
state[2] ^= round_key[4*r+2];
}
void pyjamask_96_enc(const uint8_t *plaintext, const uint8_t *key, uint8_t *ciphertext)
{
int r;
uint32_t state[STATE_SIZE_96];
uint32_t round_keys[4*(NB_ROUNDS_KS+1)];
key_schedule(key, round_keys);
load_state(plaintext, state, STATE_SIZE_96);
for (r=0; r<NB_ROUNDS_96; r++)
{
add_round_key_96(state, round_keys, r);
sub_bytes_96(state);
mix_rows_96(state);
}
add_round_key_96(state, round_keys, NB_ROUNDS_96);
unload_state(ciphertext, state, STATE_SIZE_96);
}
//==============================================================================
//=== Pyjamask-96 (decryption)
//==============================================================================
void inv_mix_rows_96(uint32_t *state)
{
state[0] = mat_mult(COL_INV_M0, state[0]);
state[1] = mat_mult(COL_INV_M1, state[1]);
state[2] = mat_mult(COL_INV_M2, state[2]);
}
void inv_sub_bytes_96(uint32_t *state)
{
// swap state[0] <-> state[1]
state[0] ^= state[1];
state[1] ^= state[0];
state[0] ^= state[1];
state[2] = ~state[2];
state[0] ^= state[1];
state[2] ^= state[0];
state[1] ^= state[2] & state[0];
state[0] ^= state[1] & state[2];
state[2] ^= state[0] & state[1];
state[1] ^= state[2];
state[0] ^= state[1];
}
void pyjamask_96_dec(const uint8_t *ciphertext, const uint8_t *key, uint8_t *plaintext)
{
int r;
uint32_t state[STATE_SIZE_96];
uint32_t round_keys[4*(NB_ROUNDS_KS+1)];
key_schedule(key, round_keys);
load_state(ciphertext, state, STATE_SIZE_96);
add_round_key_96(state, round_keys, NB_ROUNDS_96);
for (r=NB_ROUNDS_96-1; r>=0; r--)
{
inv_mix_rows_96(state);
inv_sub_bytes_96(state);
add_round_key_96(state, round_keys, r);
}
unload_state(plaintext, state, STATE_SIZE_96);
}
//==============================================================================
//=== Pyjamask-128 (encryption)
//==============================================================================
void mix_rows_128(uint32_t *state)
{
state[0] = mat_mult(COL_M0, state[0]);
state[1] = mat_mult(COL_M1, state[1]);
state[2] = mat_mult(COL_M2, state[2]);
state[3] = mat_mult(COL_M3, state[3]);
}
void sub_bytes_128(uint32_t *state)
{
state[0] ^= state[3];
state[3] ^= state[0] & state[1];
state[0] ^= state[1] & state[2];
state[1] ^= state[2] & state[3];
state[2] ^= state[0] & state[3];
state[2] ^= state[1];
state[1] ^= state[0];
state[3] = ~state[3];
// swap state[2] <-> state[3]
state[2] ^= state[3];
state[3] ^= state[2];
state[2] ^= state[3];
}
void add_round_key_128(uint32_t *state, const uint32_t *round_key, int r)
{
state[0] ^= round_key[4*r+0];
state[1] ^= round_key[4*r+1];
state[2] ^= round_key[4*r+2];
state[3] ^= round_key[4*r+3];
}
void pyjamask_128_enc(const uint8_t *plaintext, const uint8_t *key, uint8_t *ciphertext)
{
int r;
uint32_t state[STATE_SIZE_128];
uint32_t round_keys[4*(NB_ROUNDS_KS+1)];
key_schedule(key, round_keys);
load_state(plaintext, state, STATE_SIZE_128);
for (r=0; r<NB_ROUNDS_128; r++)
{
add_round_key_128(state, round_keys, r);
sub_bytes_128(state);
mix_rows_128(state);
}
add_round_key_128(state, round_keys, NB_ROUNDS_128);
unload_state(ciphertext, state, STATE_SIZE_128);
}
//==============================================================================
//=== Pyjamask-128 (decryption)
//==============================================================================
void inv_mix_rows_128(uint32_t *state)
{
state[0] = mat_mult(COL_INV_M0, state[0]);
state[1] = mat_mult(COL_INV_M1, state[1]);
state[2] = mat_mult(COL_INV_M2, state[2]);
state[3] = mat_mult(COL_INV_M3, state[3]);
}
void inv_sub_bytes_128(uint32_t *state)
{
// swap state[2] <-> state[3]
state[2] ^= state[3];
state[3] ^= state[2];
state[2] ^= state[3];
state[3] = ~state[3];
state[1] ^= state[0];
state[2] ^= state[1];
state[2] ^= state[3] & state[0];
state[1] ^= state[2] & state[3];
state[0] ^= state[1] & state[2];
state[3] ^= state[0] & state[1];
state[0] ^= state[3];
}
void pyjamask_128_dec(const uint8_t *ciphertext, const uint8_t *key, uint8_t *plaintext)
{
int r;
uint32_t state[STATE_SIZE_128];
uint32_t round_keys[4*(NB_ROUNDS_KS+1)];
key_schedule(key, round_keys);
load_state(ciphertext, state, STATE_SIZE_128);
add_round_key_128(state, round_keys, NB_ROUNDS_128);
for (r=NB_ROUNDS_128-1; r>=0; r--)
{
inv_mix_rows_128(state);
inv_sub_bytes_128(state);
add_round_key_128(state, round_keys, r);
}
unload_state(plaintext, state, STATE_SIZE_128);
}