-
Notifications
You must be signed in to change notification settings - Fork 129
/
fixslice64.rs
1509 lines (1325 loc) · 42.1 KB
/
fixslice64.rs
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
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
//! Fixsliced implementations of AES-128, AES-192 and AES-256 (64-bit)
//! adapted from the C implementation.
//!
//! All implementations are fully bitsliced and do not rely on any
//! Look-Up Table (LUT).
//!
//! See the paper at <https://eprint.iacr.org/2020/1123.pdf> for more details.
//!
//! # Author (original C code)
//!
//! Alexandre Adomnicai, Nanyang Technological University, Singapore
//! <alexandre.adomnicai@ntu.edu.sg>
//!
//! Originally licensed MIT. Relicensed as Apache 2.0+MIT with permission.
#![allow(clippy::unreadable_literal)]
use crate::Block;
use cipher::{
consts::{U16, U24, U32},
generic_array::GenericArray,
};
/// AES block batch size for this implementation
pub(crate) const FIXSLICE_BLOCKS: usize = 4;
/// AES-128 round keys
pub(crate) type FixsliceKeys128 = [u64; 88];
/// AES-192 round keys
pub(crate) type FixsliceKeys192 = [u64; 104];
/// AES-256 round keys
pub(crate) type FixsliceKeys256 = [u64; 120];
/// 512-bit internal state
pub(crate) type State = [u64; 8];
/// Fully bitsliced AES-128 key schedule to match the fully-fixsliced representation.
pub(crate) fn aes128_key_schedule(key: &GenericArray<u8, U16>) -> FixsliceKeys128 {
let mut rkeys = [0u64; 88];
bitslice(&mut rkeys[..8], key, key, key, key);
let mut rk_off = 0;
for rcon in 0..10 {
memshift32(&mut rkeys, rk_off);
rk_off += 8;
sub_bytes(&mut rkeys[rk_off..(rk_off + 8)]);
sub_bytes_nots(&mut rkeys[rk_off..(rk_off + 8)]);
if rcon < 8 {
add_round_constant_bit(&mut rkeys[rk_off..(rk_off + 8)], rcon);
} else {
add_round_constant_bit(&mut rkeys[rk_off..(rk_off + 8)], rcon - 8);
add_round_constant_bit(&mut rkeys[rk_off..(rk_off + 8)], rcon - 7);
add_round_constant_bit(&mut rkeys[rk_off..(rk_off + 8)], rcon - 5);
add_round_constant_bit(&mut rkeys[rk_off..(rk_off + 8)], rcon - 4);
}
xor_columns(&mut rkeys, rk_off, 8, ror_distance(1, 3));
}
// Adjust to match fixslicing format
#[cfg(feature = "compact")]
{
for i in (8..88).step_by(16) {
inv_shift_rows_1(&mut rkeys[i..(i + 8)]);
}
}
#[cfg(not(feature = "compact"))]
{
for i in (8..72).step_by(32) {
inv_shift_rows_1(&mut rkeys[i..(i + 8)]);
inv_shift_rows_2(&mut rkeys[(i + 8)..(i + 16)]);
inv_shift_rows_3(&mut rkeys[(i + 16)..(i + 24)]);
}
inv_shift_rows_1(&mut rkeys[72..80]);
}
// Account for NOTs removed from sub_bytes
for i in 1..11 {
sub_bytes_nots(&mut rkeys[(i * 8)..(i * 8 + 8)]);
}
rkeys
}
/// Fully bitsliced AES-192 key schedule to match the fully-fixsliced representation.
pub(crate) fn aes192_key_schedule(key: &GenericArray<u8, U24>) -> FixsliceKeys192 {
let mut rkeys = [0u64; 104];
let mut tmp = [0u64; 8];
bitslice(
&mut rkeys[..8],
&key[..16],
&key[..16],
&key[..16],
&key[..16],
);
bitslice(&mut tmp, &key[8..], &key[8..], &key[8..], &key[8..]);
let mut rcon = 0;
let mut rk_off = 8;
loop {
for i in 0..8 {
rkeys[rk_off + i] = (0x00ff00ff00ff00ff & (tmp[i] >> 8))
| (0xff00ff00ff00ff00 & (rkeys[(rk_off - 8) + i] << 8));
}
sub_bytes(&mut tmp);
sub_bytes_nots(&mut tmp);
add_round_constant_bit(&mut tmp, rcon);
rcon += 1;
for i in 0..8 {
let mut ti = rkeys[rk_off + i];
ti ^= 0x0f000f000f000f00 & ror(tmp[i], ror_distance(1, 1));
ti ^= 0xf000f000f000f000 & (ti << 4);
tmp[i] = ti;
}
rkeys[rk_off..(rk_off + 8)].copy_from_slice(&tmp);
rk_off += 8;
for i in 0..8 {
let ui = tmp[i];
let mut ti = (0x00ff00ff00ff00ff & (rkeys[(rk_off - 16) + i] >> 8))
| (0xff00ff00ff00ff00 & (ui << 8));
ti ^= 0x000f000f000f000f & (ui >> 12);
tmp[i] = ti
^ (0xfff0fff0fff0fff0 & (ti << 4))
^ (0xff00ff00ff00ff00 & (ti << 8))
^ (0xf000f000f000f000 & (ti << 12));
}
rkeys[rk_off..(rk_off + 8)].copy_from_slice(&tmp);
rk_off += 8;
sub_bytes(&mut tmp);
sub_bytes_nots(&mut tmp);
add_round_constant_bit(&mut tmp, rcon);
rcon += 1;
for i in 0..8 {
let mut ti = (0x00ff00ff00ff00ff & (rkeys[(rk_off - 16) + i] >> 8))
| (0xff00ff00ff00ff00 & (rkeys[(rk_off - 8) + i] << 8));
ti ^= 0x000f000f000f000f & ror(tmp[i], ror_distance(1, 3));
rkeys[rk_off + i] = ti
^ (0xfff0fff0fff0fff0 & (ti << 4))
^ (0xff00ff00ff00ff00 & (ti << 8))
^ (0xf000f000f000f000 & (ti << 12));
}
rk_off += 8;
if rcon >= 8 {
break;
}
for i in 0..8 {
let ui = rkeys[(rk_off - 8) + i];
let mut ti = rkeys[(rk_off - 16) + i];
ti ^= 0x0f000f000f000f00 & (ui >> 4);
ti ^= 0xf000f000f000f000 & (ti << 4);
tmp[i] = ti;
}
}
// Adjust to match fixslicing format
#[cfg(feature = "compact")]
{
for i in (8..104).step_by(16) {
inv_shift_rows_1(&mut rkeys[i..(i + 8)]);
}
}
#[cfg(not(feature = "compact"))]
{
for i in (0..96).step_by(32) {
inv_shift_rows_1(&mut rkeys[(i + 8)..(i + 16)]);
inv_shift_rows_2(&mut rkeys[(i + 16)..(i + 24)]);
inv_shift_rows_3(&mut rkeys[(i + 24)..(i + 32)]);
}
}
// Account for NOTs removed from sub_bytes
for i in 1..13 {
sub_bytes_nots(&mut rkeys[(i * 8)..(i * 8 + 8)]);
}
rkeys
}
/// Fully bitsliced AES-256 key schedule to match the fully-fixsliced representation.
pub(crate) fn aes256_key_schedule(key: &GenericArray<u8, U32>) -> FixsliceKeys256 {
let mut rkeys = [0u64; 120];
bitslice(
&mut rkeys[..8],
&key[..16],
&key[..16],
&key[..16],
&key[..16],
);
bitslice(
&mut rkeys[8..16],
&key[16..],
&key[16..],
&key[16..],
&key[16..],
);
let mut rk_off = 8;
let mut rcon = 0;
loop {
memshift32(&mut rkeys, rk_off);
rk_off += 8;
sub_bytes(&mut rkeys[rk_off..(rk_off + 8)]);
sub_bytes_nots(&mut rkeys[rk_off..(rk_off + 8)]);
add_round_constant_bit(&mut rkeys[rk_off..(rk_off + 8)], rcon);
xor_columns(&mut rkeys, rk_off, 16, ror_distance(1, 3));
rcon += 1;
if rcon == 7 {
break;
}
memshift32(&mut rkeys, rk_off);
rk_off += 8;
sub_bytes(&mut rkeys[rk_off..(rk_off + 8)]);
sub_bytes_nots(&mut rkeys[rk_off..(rk_off + 8)]);
xor_columns(&mut rkeys, rk_off, 16, ror_distance(0, 3));
}
// Adjust to match fixslicing format
#[cfg(feature = "compact")]
{
for i in (8..120).step_by(16) {
inv_shift_rows_1(&mut rkeys[i..(i + 8)]);
}
}
#[cfg(not(feature = "compact"))]
{
for i in (8..104).step_by(32) {
inv_shift_rows_1(&mut rkeys[i..(i + 8)]);
inv_shift_rows_2(&mut rkeys[(i + 8)..(i + 16)]);
inv_shift_rows_3(&mut rkeys[(i + 16)..(i + 24)]);
}
inv_shift_rows_1(&mut rkeys[104..112]);
}
// Account for NOTs removed from sub_bytes
for i in 1..15 {
sub_bytes_nots(&mut rkeys[(i * 8)..(i * 8 + 8)]);
}
rkeys
}
/// Fully-fixsliced AES-128 decryption (the InvShiftRows is completely omitted).
///
/// Decrypts four blocks in-place and in parallel.
pub(crate) fn aes128_decrypt(rkeys: &FixsliceKeys128, blocks: &mut [Block]) {
debug_assert_eq!(blocks.len(), FIXSLICE_BLOCKS);
let mut state = State::default();
bitslice(&mut state, &blocks[0], &blocks[1], &blocks[2], &blocks[3]);
add_round_key(&mut state, &rkeys[80..]);
inv_sub_bytes(&mut state);
#[cfg(not(feature = "compact"))]
{
inv_shift_rows_2(&mut state);
}
let mut rk_off = 72;
loop {
#[cfg(feature = "compact")]
{
inv_shift_rows_2(&mut state);
}
add_round_key(&mut state, &rkeys[rk_off..(rk_off + 8)]);
inv_mix_columns_1(&mut state);
inv_sub_bytes(&mut state);
rk_off -= 8;
if rk_off == 0 {
break;
}
add_round_key(&mut state, &rkeys[rk_off..(rk_off + 8)]);
inv_mix_columns_0(&mut state);
inv_sub_bytes(&mut state);
rk_off -= 8;
#[cfg(not(feature = "compact"))]
{
add_round_key(&mut state, &rkeys[rk_off..(rk_off + 8)]);
inv_mix_columns_3(&mut state);
inv_sub_bytes(&mut state);
rk_off -= 8;
add_round_key(&mut state, &rkeys[rk_off..(rk_off + 8)]);
inv_mix_columns_2(&mut state);
inv_sub_bytes(&mut state);
rk_off -= 8;
}
}
add_round_key(&mut state, &rkeys[..8]);
inv_bitslice(&state, blocks);
}
/// Fully-fixsliced AES-128 encryption (the ShiftRows is completely omitted).
///
/// Encrypts four blocks in-place and in parallel.
pub(crate) fn aes128_encrypt(rkeys: &FixsliceKeys128, blocks: &mut [Block]) {
debug_assert_eq!(blocks.len(), FIXSLICE_BLOCKS);
let mut state = State::default();
bitslice(&mut state, &blocks[0], &blocks[1], &blocks[2], &blocks[3]);
add_round_key(&mut state, &rkeys[..8]);
let mut rk_off = 8;
loop {
sub_bytes(&mut state);
mix_columns_1(&mut state);
add_round_key(&mut state, &rkeys[rk_off..(rk_off + 8)]);
rk_off += 8;
#[cfg(feature = "compact")]
{
shift_rows_2(&mut state);
}
if rk_off == 80 {
break;
}
#[cfg(not(feature = "compact"))]
{
sub_bytes(&mut state);
mix_columns_2(&mut state);
add_round_key(&mut state, &rkeys[rk_off..(rk_off + 8)]);
rk_off += 8;
sub_bytes(&mut state);
mix_columns_3(&mut state);
add_round_key(&mut state, &rkeys[rk_off..(rk_off + 8)]);
rk_off += 8;
}
sub_bytes(&mut state);
mix_columns_0(&mut state);
add_round_key(&mut state, &rkeys[rk_off..(rk_off + 8)]);
rk_off += 8;
}
#[cfg(not(feature = "compact"))]
{
shift_rows_2(&mut state);
}
sub_bytes(&mut state);
add_round_key(&mut state, &rkeys[80..]);
inv_bitslice(&state, blocks);
}
/// Fully-fixsliced AES-192 decryption (the InvShiftRows is completely omitted).
///
/// Decrypts four blocks in-place and in parallel.
pub(crate) fn aes192_decrypt(rkeys: &FixsliceKeys192, blocks: &mut [Block]) {
debug_assert_eq!(blocks.len(), FIXSLICE_BLOCKS);
let mut state = State::default();
bitslice(&mut state, &blocks[0], &blocks[1], &blocks[2], &blocks[3]);
add_round_key(&mut state, &rkeys[96..]);
inv_sub_bytes(&mut state);
let mut rk_off = 88;
loop {
#[cfg(feature = "compact")]
{
inv_shift_rows_2(&mut state);
}
#[cfg(not(feature = "compact"))]
{
add_round_key(&mut state, &rkeys[rk_off..(rk_off + 8)]);
inv_mix_columns_3(&mut state);
inv_sub_bytes(&mut state);
rk_off -= 8;
add_round_key(&mut state, &rkeys[rk_off..(rk_off + 8)]);
inv_mix_columns_2(&mut state);
inv_sub_bytes(&mut state);
rk_off -= 8;
}
add_round_key(&mut state, &rkeys[rk_off..(rk_off + 8)]);
inv_mix_columns_1(&mut state);
inv_sub_bytes(&mut state);
rk_off -= 8;
if rk_off == 0 {
break;
}
add_round_key(&mut state, &rkeys[rk_off..(rk_off + 8)]);
inv_mix_columns_0(&mut state);
inv_sub_bytes(&mut state);
rk_off -= 8;
}
add_round_key(&mut state, &rkeys[..8]);
inv_bitslice(&state, blocks);
}
/// Fully-fixsliced AES-192 encryption (the ShiftRows is completely omitted).
///
/// Encrypts four blocks in-place and in parallel.
pub(crate) fn aes192_encrypt(rkeys: &FixsliceKeys192, blocks: &mut [Block]) {
debug_assert_eq!(blocks.len(), FIXSLICE_BLOCKS);
let mut state = State::default();
bitslice(&mut state, &blocks[0], &blocks[1], &blocks[2], &blocks[3]);
add_round_key(&mut state, &rkeys[..8]);
let mut rk_off = 8;
loop {
sub_bytes(&mut state);
mix_columns_1(&mut state);
add_round_key(&mut state, &rkeys[rk_off..(rk_off + 8)]);
rk_off += 8;
#[cfg(feature = "compact")]
{
shift_rows_2(&mut state);
}
#[cfg(not(feature = "compact"))]
{
sub_bytes(&mut state);
mix_columns_2(&mut state);
add_round_key(&mut state, &rkeys[rk_off..(rk_off + 8)]);
rk_off += 8;
sub_bytes(&mut state);
mix_columns_3(&mut state);
add_round_key(&mut state, &rkeys[rk_off..(rk_off + 8)]);
rk_off += 8;
}
if rk_off == 96 {
break;
}
sub_bytes(&mut state);
mix_columns_0(&mut state);
add_round_key(&mut state, &rkeys[rk_off..(rk_off + 8)]);
rk_off += 8;
}
sub_bytes(&mut state);
add_round_key(&mut state, &rkeys[96..]);
inv_bitslice(&state, blocks);
}
/// Fully-fixsliced AES-256 decryption (the InvShiftRows is completely omitted).
///
/// Decrypts four blocks in-place and in parallel.
pub(crate) fn aes256_decrypt(rkeys: &FixsliceKeys256, blocks: &mut [Block]) {
debug_assert_eq!(blocks.len(), FIXSLICE_BLOCKS);
let mut state = State::default();
bitslice(&mut state, &blocks[0], &blocks[1], &blocks[2], &blocks[3]);
add_round_key(&mut state, &rkeys[112..]);
inv_sub_bytes(&mut state);
#[cfg(not(feature = "compact"))]
{
inv_shift_rows_2(&mut state);
}
let mut rk_off = 104;
loop {
#[cfg(feature = "compact")]
{
inv_shift_rows_2(&mut state);
}
add_round_key(&mut state, &rkeys[rk_off..(rk_off + 8)]);
inv_mix_columns_1(&mut state);
inv_sub_bytes(&mut state);
rk_off -= 8;
if rk_off == 0 {
break;
}
add_round_key(&mut state, &rkeys[rk_off..(rk_off + 8)]);
inv_mix_columns_0(&mut state);
inv_sub_bytes(&mut state);
rk_off -= 8;
#[cfg(not(feature = "compact"))]
{
add_round_key(&mut state, &rkeys[rk_off..(rk_off + 8)]);
inv_mix_columns_3(&mut state);
inv_sub_bytes(&mut state);
rk_off -= 8;
add_round_key(&mut state, &rkeys[rk_off..(rk_off + 8)]);
inv_mix_columns_2(&mut state);
inv_sub_bytes(&mut state);
rk_off -= 8;
}
}
add_round_key(&mut state, &rkeys[..8]);
inv_bitslice(&state, blocks);
}
/// Fully-fixsliced AES-256 encryption (the ShiftRows is completely omitted).
///
/// Encrypts four blocks in-place and in parallel.
pub(crate) fn aes256_encrypt(rkeys: &FixsliceKeys256, blocks: &mut [Block]) {
debug_assert_eq!(blocks.len(), FIXSLICE_BLOCKS);
let mut state = State::default();
bitslice(&mut state, &blocks[0], &blocks[1], &blocks[2], &blocks[3]);
add_round_key(&mut state, &rkeys[..8]);
let mut rk_off = 8;
loop {
sub_bytes(&mut state);
mix_columns_1(&mut state);
add_round_key(&mut state, &rkeys[rk_off..(rk_off + 8)]);
rk_off += 8;
#[cfg(feature = "compact")]
{
shift_rows_2(&mut state);
}
if rk_off == 112 {
break;
}
#[cfg(not(feature = "compact"))]
{
sub_bytes(&mut state);
mix_columns_2(&mut state);
add_round_key(&mut state, &rkeys[rk_off..(rk_off + 8)]);
rk_off += 8;
sub_bytes(&mut state);
mix_columns_3(&mut state);
add_round_key(&mut state, &rkeys[rk_off..(rk_off + 8)]);
rk_off += 8;
}
sub_bytes(&mut state);
mix_columns_0(&mut state);
add_round_key(&mut state, &rkeys[rk_off..(rk_off + 8)]);
rk_off += 8;
}
#[cfg(not(feature = "compact"))]
{
shift_rows_2(&mut state);
}
sub_bytes(&mut state);
add_round_key(&mut state, &rkeys[112..]);
inv_bitslice(&state, blocks);
}
/// Note that the 4 bitwise NOT (^= 0xffffffffffffffff) are accounted for here so that it is a true
/// inverse of 'sub_bytes'.
fn inv_sub_bytes(state: &mut [u64]) {
debug_assert_eq!(state.len(), 8);
// Scheduled using https://github.com/Ko-/aes-armcortexm/tree/public/scheduler
// Inline "stack" comments reflect suggested stores and loads (ARM Cortex-M3 and M4)
let u7 = state[0];
let u6 = state[1];
let u5 = state[2];
let u4 = state[3];
let u3 = state[4];
let u2 = state[5];
let u1 = state[6];
let u0 = state[7];
let t23 = u0 ^ u3;
let t8 = u1 ^ t23;
let m2 = t23 & t8;
let t4 = u4 ^ t8;
let t22 = u1 ^ u3;
let t2 = u0 ^ u1;
let t1 = u3 ^ u4;
// t23 -> stack
let t9 = u7 ^ t1;
// t8 -> stack
let m7 = t22 & t9;
// t9 -> stack
let t24 = u4 ^ u7;
// m7 -> stack
let t10 = t2 ^ t24;
// u4 -> stack
let m14 = t2 & t10;
let r5 = u6 ^ u7;
// m2 -> stack
let t3 = t1 ^ r5;
// t2 -> stack
let t13 = t2 ^ r5;
let t19 = t22 ^ r5;
// t3 -> stack
let t17 = u2 ^ t19;
// t4 -> stack
let t25 = u2 ^ t1;
let r13 = u1 ^ u6;
// t25 -> stack
let t20 = t24 ^ r13;
// t17 -> stack
let m9 = t20 & t17;
// t20 -> stack
let r17 = u2 ^ u5;
// t22 -> stack
let t6 = t22 ^ r17;
// t13 -> stack
let m1 = t13 & t6;
let y5 = u0 ^ r17;
let m4 = t19 & y5;
let m5 = m4 ^ m1;
let m17 = m5 ^ t24;
let r18 = u5 ^ u6;
let t27 = t1 ^ r18;
let t15 = t10 ^ t27;
// t6 -> stack
let m11 = t1 & t15;
let m15 = m14 ^ m11;
let m21 = m17 ^ m15;
// t1 -> stack
// t4 <- stack
let m12 = t4 & t27;
let m13 = m12 ^ m11;
let t14 = t10 ^ r18;
let m3 = t14 ^ m1;
// m2 <- stack
let m16 = m3 ^ m2;
let m20 = m16 ^ m13;
// u4 <- stack
let r19 = u2 ^ u4;
let t16 = r13 ^ r19;
// t3 <- stack
let t26 = t3 ^ t16;
let m6 = t3 & t16;
let m8 = t26 ^ m6;
// t10 -> stack
// m7 <- stack
let m18 = m8 ^ m7;
let m22 = m18 ^ m13;
let m25 = m22 & m20;
let m26 = m21 ^ m25;
let m10 = m9 ^ m6;
let m19 = m10 ^ m15;
// t25 <- stack
let m23 = m19 ^ t25;
let m28 = m23 ^ m25;
let m24 = m22 ^ m23;
let m30 = m26 & m24;
let m39 = m23 ^ m30;
let m48 = m39 & y5;
let m57 = m39 & t19;
// m48 -> stack
let m36 = m24 ^ m25;
let m31 = m20 & m23;
let m27 = m20 ^ m21;
let m32 = m27 & m31;
let m29 = m28 & m27;
let m37 = m21 ^ m29;
// m39 -> stack
let m42 = m37 ^ m39;
let m52 = m42 & t15;
// t27 -> stack
// t1 <- stack
let m61 = m42 & t1;
let p0 = m52 ^ m61;
let p16 = m57 ^ m61;
// m57 -> stack
// t20 <- stack
let m60 = m37 & t20;
// p16 -> stack
// t17 <- stack
let m51 = m37 & t17;
let m33 = m27 ^ m25;
let m38 = m32 ^ m33;
let m43 = m37 ^ m38;
let m49 = m43 & t16;
let p6 = m49 ^ m60;
let p13 = m49 ^ m51;
let m58 = m43 & t3;
// t9 <- stack
let m50 = m38 & t9;
// t22 <- stack
let m59 = m38 & t22;
// p6 -> stack
let p1 = m58 ^ m59;
let p7 = p0 ^ p1;
let m34 = m21 & m22;
let m35 = m24 & m34;
let m40 = m35 ^ m36;
let m41 = m38 ^ m40;
let m45 = m42 ^ m41;
// t27 <- stack
let m53 = m45 & t27;
let p8 = m50 ^ m53;
let p23 = p7 ^ p8;
// t4 <- stack
let m62 = m45 & t4;
let p14 = m49 ^ m62;
let s6 = p14 ^ p23;
// t10 <- stack
let m54 = m41 & t10;
let p2 = m54 ^ m62;
let p22 = p2 ^ p7;
let s0 = p13 ^ p22;
let p17 = m58 ^ p2;
let p15 = m54 ^ m59;
// t2 <- stack
let m63 = m41 & t2;
// m39 <- stack
let m44 = m39 ^ m40;
// p17 -> stack
// t6 <- stack
let m46 = m44 & t6;
let p5 = m46 ^ m51;
// p23 -> stack
let p18 = m63 ^ p5;
let p24 = p5 ^ p7;
// m48 <- stack
let p12 = m46 ^ m48;
let s3 = p12 ^ p22;
// t13 <- stack
let m55 = m44 & t13;
let p9 = m55 ^ m63;
// p16 <- stack
let s7 = p9 ^ p16;
// t8 <- stack
let m47 = m40 & t8;
let p3 = m47 ^ m50;
let p19 = p2 ^ p3;
let s5 = p19 ^ p24;
let p11 = p0 ^ p3;
let p26 = p9 ^ p11;
// t23 <- stack
let m56 = m40 & t23;
let p4 = m48 ^ m56;
// p6 <- stack
let p20 = p4 ^ p6;
let p29 = p15 ^ p20;
let s1 = p26 ^ p29;
// m57 <- stack
let p10 = m57 ^ p4;
let p27 = p10 ^ p18;
// p23 <- stack
let s4 = p23 ^ p27;
let p25 = p6 ^ p10;
let p28 = p11 ^ p25;
// p17 <- stack
let s2 = p17 ^ p28;
state[0] = s7;
state[1] = s6;
state[2] = s5;
state[3] = s4;
state[4] = s3;
state[5] = s2;
state[6] = s1;
state[7] = s0;
}
/// Bitsliced implementation of the AES Sbox based on Boyar, Peralta and Calik.
///
/// See: <http://www.cs.yale.edu/homes/peralta/CircuitStuff/SLP_AES_113.txt>
///
/// Note that the 4 bitwise NOT (^= 0xffffffffffffffff) are moved to the key schedule.
fn sub_bytes(state: &mut [u64]) {
debug_assert_eq!(state.len(), 8);
// Scheduled using https://github.com/Ko-/aes-armcortexm/tree/public/scheduler
// Inline "stack" comments reflect suggested stores and loads (ARM Cortex-M3 and M4)
let u7 = state[0];
let u6 = state[1];
let u5 = state[2];
let u4 = state[3];
let u3 = state[4];
let u2 = state[5];
let u1 = state[6];
let u0 = state[7];
let y14 = u3 ^ u5;
let y13 = u0 ^ u6;
let y12 = y13 ^ y14;
let t1 = u4 ^ y12;
let y15 = t1 ^ u5;
let t2 = y12 & y15;
let y6 = y15 ^ u7;
let y20 = t1 ^ u1;
// y12 -> stack
let y9 = u0 ^ u3;
// y20 -> stack
let y11 = y20 ^ y9;
// y9 -> stack
let t12 = y9 & y11;
// y6 -> stack
let y7 = u7 ^ y11;
let y8 = u0 ^ u5;
let t0 = u1 ^ u2;
let y10 = y15 ^ t0;
// y15 -> stack
let y17 = y10 ^ y11;
// y14 -> stack
let t13 = y14 & y17;
let t14 = t13 ^ t12;
// y17 -> stack
let y19 = y10 ^ y8;
// y10 -> stack
let t15 = y8 & y10;
let t16 = t15 ^ t12;
let y16 = t0 ^ y11;
// y11 -> stack
let y21 = y13 ^ y16;
// y13 -> stack
let t7 = y13 & y16;
// y16 -> stack
let y18 = u0 ^ y16;
let y1 = t0 ^ u7;
let y4 = y1 ^ u3;
// u7 -> stack
let t5 = y4 & u7;
let t6 = t5 ^ t2;
let t18 = t6 ^ t16;
let t22 = t18 ^ y19;
let y2 = y1 ^ u0;
let t10 = y2 & y7;
let t11 = t10 ^ t7;
let t20 = t11 ^ t16;
let t24 = t20 ^ y18;
let y5 = y1 ^ u6;
let t8 = y5 & y1;
let t9 = t8 ^ t7;
let t19 = t9 ^ t14;
let t23 = t19 ^ y21;
let y3 = y5 ^ y8;
// y6 <- stack
let t3 = y3 & y6;
let t4 = t3 ^ t2;
// y20 <- stack
let t17 = t4 ^ y20;
let t21 = t17 ^ t14;
let t26 = t21 & t23;
let t27 = t24 ^ t26;
let t31 = t22 ^ t26;
let t25 = t21 ^ t22;
// y4 -> stack
let t28 = t25 & t27;
let t29 = t28 ^ t22;
let z14 = t29 & y2;
let z5 = t29 & y7;
let t30 = t23 ^ t24;
let t32 = t31 & t30;
let t33 = t32 ^ t24;
let t35 = t27 ^ t33;
let t36 = t24 & t35;
let t38 = t27 ^ t36;
let t39 = t29 & t38;
let t40 = t25 ^ t39;
let t43 = t29 ^ t40;
// y16 <- stack
let z3 = t43 & y16;
let tc12 = z3 ^ z5;
// tc12 -> stack
// y13 <- stack
let z12 = t43 & y13;
let z13 = t40 & y5;
let z4 = t40 & y1;
let tc6 = z3 ^ z4;
let t34 = t23 ^ t33;
let t37 = t36 ^ t34;
let t41 = t40 ^ t37;
// y10 <- stack
let z8 = t41 & y10;
let z17 = t41 & y8;
let t44 = t33 ^ t37;
// y15 <- stack
let z0 = t44 & y15;
// z17 -> stack
// y12 <- stack
let z9 = t44 & y12;
let z10 = t37 & y3;
let z1 = t37 & y6;
let tc5 = z1 ^ z0;
let tc11 = tc6 ^ tc5;
// y4 <- stack
let z11 = t33 & y4;
let t42 = t29 ^ t33;
let t45 = t42 ^ t41;
// y17 <- stack
let z7 = t45 & y17;
let tc8 = z7 ^ tc6;
// y14 <- stack
let z16 = t45 & y14;
// y11 <- stack
let z6 = t42 & y11;
let tc16 = z6 ^ tc8;
// z14 -> stack
// y9 <- stack
let z15 = t42 & y9;
let tc20 = z15 ^ tc16;
let tc1 = z15 ^ z16;
let tc2 = z10 ^ tc1;
let tc21 = tc2 ^ z11;
let tc3 = z9 ^ tc2;
let s0 = tc3 ^ tc16;
let s3 = tc3 ^ tc11;
let s1 = s3 ^ tc16;
let tc13 = z13 ^ tc1;
// u7 <- stack
let z2 = t33 & u7;
let tc4 = z0 ^ z2;
let tc7 = z12 ^ tc4;
let tc9 = z8 ^ tc7;
let tc10 = tc8 ^ tc9;
// z14 <- stack
let tc17 = z14 ^ tc10;
let s5 = tc21 ^ tc17;
let tc26 = tc17 ^ tc20;
// z17 <- stack
let s2 = tc26 ^ z17;
// tc12 <- stack
let tc14 = tc4 ^ tc12;
let tc18 = tc13 ^ tc14;
let s6 = tc10 ^ tc18;
let s7 = z12 ^ tc18;
let s4 = tc14 ^ s3;
state[0] = s7;
state[1] = s6;
state[2] = s5;
state[3] = s4;
state[4] = s3;
state[5] = s2;
state[6] = s1;
state[7] = s0;
}
/// NOT operations that are omitted in S-box
#[inline]
fn sub_bytes_nots(state: &mut [u64]) {
debug_assert_eq!(state.len(), 8);
state[0] ^= 0xffffffffffffffff;
state[1] ^= 0xffffffffffffffff;
state[5] ^= 0xffffffffffffffff;
state[6] ^= 0xffffffffffffffff;
}
/// Computation of the MixColumns transformation in the fixsliced representation, with different
/// rotations used according to the round number mod 4.
///
/// Based on Käsper-Schwabe, similar to https://github.com/Ko-/aes-armcortexm.
macro_rules! define_mix_columns {
(
$name:ident,
$name_inv:ident,
$first_rotate:path,
$second_rotate:path
) => {
#[rustfmt::skip]
fn $name(state: &mut State) {