forked from kj3moraes/further-testing-xmss
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathxmss_core_fast.c
1200 lines (1014 loc) · 41.8 KB
/
xmss_core_fast.c
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
#include <stdlib.h>
#include <string.h>
#include <stdint.h>
#include "hash.h"
#include "hash_address.h"
#include "params.h"
#include "randombytes.h"
#include "wots.h"
#include "utils.h"
#include "xmss_commons.h"
#include "xmss_core.h"
typedef struct{
unsigned char h;
unsigned long next_idx;
unsigned char stackusage;
unsigned char completed;
unsigned char *node;
#ifdef FORWARD_SECURE
unsigned char *seed_active;
unsigned char *seed_next;
#endif
} treehash_inst;
typedef struct {
unsigned char *stack;
unsigned int stackoffset;
unsigned char *stacklevels;
unsigned char *auth;
unsigned char *keep;
treehash_inst *treehash;
unsigned char *retain;
unsigned int next_leaf;
#ifdef FORWARD_SECURE
unsigned char *left_leaf;
#endif
} bds_state;
/* These serialization functions provide a transition between the current
way of storing the state in an exposed struct, and storing it as part of the
byte array that is the secret key.
They will probably be refactored in a non-backwards-compatible way, soon. */
static void xmssmt_serialize_state(const xmss_params *params,
unsigned char *sk, bds_state *states)
{
unsigned int i, j;
/* Skip past the 'regular' sk */
#ifdef FORWARD_SECURE
sk += params->index_bytes + (2 + 2*params->d)*params->n;
#else
sk += params->index_bytes + 4*params->n;
#endif
for (i = 0; i < 2*params->d - 1; i++) {
sk += (params->tree_height + 1) * params->n; /* stack */
ull_to_bytes(sk, 4, states[i].stackoffset);
sk += 4;
sk += params->tree_height + 1; /* stacklevels */
sk += params->tree_height * params->n; /* auth */
sk += (params->tree_height >> 1) * params->n; /* keep */
for (j = 0; j < params->tree_height - params->bds_k; j++) {
ull_to_bytes(sk, 1, states[i].treehash[j].h);
sk += 1;
ull_to_bytes(sk, 4, states[i].treehash[j].next_idx);
sk += 4;
ull_to_bytes(sk, 1, states[i].treehash[j].stackusage);
sk += 1;
ull_to_bytes(sk, 1, states[i].treehash[j].completed);
sk += 1;
sk += params->n; /* node */
#ifdef FORWARD_SECURE
sk += params->n; /* seed_active */
sk += params->n; /* seed_next */
#endif
}
/* retain */
sk += ((1 << params->bds_k) - params->bds_k - 1) * params->n;
ull_to_bytes(sk, 4, states[i].next_leaf);
sk += 4;
#ifdef FORWARD_SECURE
/* left_leaf */
sk += params->n;
#endif
}
}
static void xmssmt_deserialize_state(const xmss_params *params,
bds_state *states,
unsigned char **wots_sigs,
unsigned char *sk)
{
unsigned int i, j;
/* Skip past the 'regular' sk */
#ifdef FORWARD_SECURE
sk += params->index_bytes + (2 + 2*params->d)*params->n;
#else
sk += params->index_bytes + 4*params->n;
#endif
for (i = 0; i < 2*params->d - 1; i++) {
states[i].stack = sk;
sk += (params->tree_height + 1) * params->n;
states[i].stackoffset = bytes_to_ull(sk, 4);
sk += 4;
states[i].stacklevels = sk;
sk += params->tree_height + 1;
states[i].auth = sk;
sk += params->tree_height * params->n;
states[i].keep = sk;
sk += (params->tree_height >> 1) * params->n;
for (j = 0; j < params->tree_height - params->bds_k; j++) {
states[i].treehash[j].h = bytes_to_ull(sk, 1);
sk += 1;
states[i].treehash[j].next_idx = bytes_to_ull(sk, 4);
sk += 4;
states[i].treehash[j].stackusage = bytes_to_ull(sk, 1);
sk += 1;
states[i].treehash[j].completed = bytes_to_ull(sk, 1);
sk += 1;
states[i].treehash[j].node = sk;
sk += params->n;
#ifdef FORWARD_SECURE
states[i].treehash[j].seed_active = sk;
sk += params->n;
states[i].treehash[j].seed_next = sk;
sk += params->n;
#endif
}
states[i].retain = sk;
sk += ((1 << params->bds_k) - params->bds_k - 1) * params->n;
states[i].next_leaf = bytes_to_ull(sk, 4);
sk += 4;
#ifdef FORWARD_SECURE
states[i].left_leaf = sk;
sk += params->n;
#endif
}
if (params->d > 1) {
*wots_sigs = sk;
}
}
static void xmss_serialize_state(const xmss_params *params,
unsigned char *sk, bds_state *state)
{
xmssmt_serialize_state(params, sk, state);
}
static void xmss_deserialize_state(const xmss_params *params,
bds_state *state, unsigned char *sk)
{
xmssmt_deserialize_state(params, state, NULL, sk);
}
/**
* Move the content of one bds_state object into another
*/
static void deep_state_move(const xmss_params *params,
bds_state *dst, bds_state *src)
{
unsigned int i;
memmove(dst->stack, src->stack,(params->tree_height + 1) * params->n);
dst->stackoffset = src->stackoffset;
memmove(dst->stacklevels, src->stacklevels, params->tree_height + 1);
memmove(dst->auth, src->auth, params->tree_height * params->n);
memmove(dst->keep, src->keep, (params->tree_height >> 1) * params->n);
for (i = 0; i < params->tree_height - params->bds_k; i++) {
dst->treehash[i].h = src->treehash[i].h;
dst->treehash[i].next_idx = src->treehash[i].next_idx;
dst->treehash[i].stackusage = src->treehash[i].stackusage;
dst->treehash[i].completed = src->treehash[i].completed;
memmove(dst->treehash[i].node, src->treehash[i].node, params->n);
#ifdef FORWARD_SECURE
memmove(dst->treehash[i].seed_active, src->treehash[i].seed_active, params->n);
memmove(dst->treehash[i].seed_next, src->treehash[i].seed_next, params->n);
// erase the seeds
memset(src->treehash[i].seed_active, 0, params->n);
memset(src->treehash[i].seed_next, 0, params->n);
#endif
}
memmove(dst->retain, src->retain, ((1 << params->bds_k) - params->bds_k - 1) * params->n);
dst->next_leaf = src->next_leaf;
}
static int treehash_minheight_on_stack(const xmss_params *params,
bds_state *state,
const treehash_inst *treehash)
{
unsigned int r = params->tree_height, i;
for (i = 0; i < treehash->stackusage; i++) {
if (state->stacklevels[state->stackoffset - i - 1] < r) {
r = state->stacklevels[state->stackoffset - i - 1];
}
}
return r;
}
/**
* Merkle's TreeHash algorithm. The address only needs to initialize the first 78 bits of addr. Everything else will be set by treehash.
* Currently only used for key generation.
*
*/
static void treehash_init(const xmss_params *params,
unsigned char *node, int height, int index,
bds_state *state, unsigned char *sk_seed,
const unsigned char *pub_seed, const uint32_t addr[8])
{
unsigned int idx = index;
// use three different addresses because at this point we use all three formats in parallel
uint32_t ots_addr[8] = {0};
uint32_t ltree_addr[8] = {0};
uint32_t node_addr[8] = {0};
// only copy layer and tree address parts
copy_subtree_addr(ots_addr, addr);
// type = ots
set_type(ots_addr, 0);
copy_subtree_addr(ltree_addr, addr);
set_type(ltree_addr, 1);
copy_subtree_addr(node_addr, addr);
set_type(node_addr, 2);
uint32_t lastnode, i;
unsigned char stack[(height+1)*params->n];
unsigned int stacklevels[height+1];
unsigned int stackoffset=0;
unsigned int nodeh;
#ifdef FORWARD_SECURE
unsigned char ots_seed[params->n];
#endif
lastnode = idx+(1<<height);
for (i = 0; i < params->tree_height-params->bds_k; i++) {
state->treehash[i].h = i;
state->treehash[i].completed = 1;
state->treehash[i].stackusage = 0;
}
i = 0;
for (; idx < lastnode; idx++) {
set_ltree_addr(ltree_addr, idx);
set_ots_addr(ots_addr, idx);
#ifdef FORWARD_SECURE
hash_prg(params, ots_seed, sk_seed, sk_seed, pub_seed, ots_addr);
gen_leaf_wots(params, stack+stackoffset*params->n, ots_seed, pub_seed, ltree_addr, ots_addr);
#else
gen_leaf_wots(params, stack+stackoffset*params->n, sk_seed, pub_seed, ltree_addr, ots_addr);
#endif
stacklevels[stackoffset] = 0;
stackoffset++;
if (params->tree_height - params->bds_k > 0 && i == 3) {
memcpy(state->treehash[0].node, stack+stackoffset*params->n, params->n);
}
#ifdef FORWARD_SECURE
unsigned int j;
for(j=0; j < params->tree_height - params->bds_k - 1; j++) {
if(idx >> j == 3 && (idx & ((1<<j)-1)) == 0) {
memcpy(state->treehash[j].seed_next, sk_seed, params->n);
}
}
#endif
while (stackoffset>1 && stacklevels[stackoffset-1] == stacklevels[stackoffset-2]) {
nodeh = stacklevels[stackoffset-1];
if (i >> nodeh == 1) {
memcpy(state->auth + nodeh*params->n, stack+(stackoffset-1)*params->n, params->n);
}
else {
if (nodeh < params->tree_height - params->bds_k && i >> nodeh == 3) {
memcpy(state->treehash[nodeh].node, stack+(stackoffset-1)*params->n, params->n);
}
else if (nodeh >= params->tree_height - params->bds_k) {
memcpy(state->retain + ((1 << (params->tree_height - 1 - nodeh)) + nodeh - params->tree_height + (((i >> nodeh) - 3) >> 1)) * params->n, stack+(stackoffset-1)*params->n, params->n);
}
}
set_tree_height(node_addr, stacklevels[stackoffset-1]);
set_tree_index(node_addr, (idx >> (stacklevels[stackoffset-1]+1)));
thash_h(params, stack+(stackoffset-2)*params->n, stack+(stackoffset-2)*params->n, pub_seed, node_addr);
stacklevels[stackoffset-2]++;
stackoffset--;
}
i++;
}
for (i = 0; i < params->n; i++) {
node[i] = stack[i];
}
}
static void treehash_update(const xmss_params *params,
treehash_inst *treehash, bds_state *state,
const unsigned char *sk_seed,
const unsigned char *pub_seed,
const uint32_t addr[8])
{
uint32_t ots_addr[8] = {0};
uint32_t ltree_addr[8] = {0};
uint32_t node_addr[8] = {0};
// only copy layer and tree address parts
copy_subtree_addr(ots_addr, addr);
// type = ots
set_type(ots_addr, 0);
copy_subtree_addr(ltree_addr, addr);
set_type(ltree_addr, 1);
copy_subtree_addr(node_addr, addr);
set_type(node_addr, 2);
set_ltree_addr(ltree_addr, treehash->next_idx);
set_ots_addr(ots_addr, treehash->next_idx);
unsigned char nodebuffer[2 * params->n];
unsigned int nodeheight = 0;
#ifdef FORWARD_SECURE
unsigned char ots_seed[params->n];
//sk_seed is not needed here suppress warning
(void) sk_seed;
hash_prg(params, ots_seed, treehash->seed_active, treehash->seed_active, pub_seed, ots_addr);
gen_leaf_wots(params, nodebuffer, ots_seed, pub_seed, ltree_addr, ots_addr);
#else
gen_leaf_wots(params, nodebuffer, sk_seed, pub_seed, ltree_addr, ots_addr);
#endif
while (treehash->stackusage > 0 && state->stacklevels[state->stackoffset-1] == nodeheight) {
memcpy(nodebuffer + params->n, nodebuffer, params->n);
memcpy(nodebuffer, state->stack + (state->stackoffset-1)*params->n, params->n);
set_tree_height(node_addr, nodeheight);
set_tree_index(node_addr, (treehash->next_idx >> (nodeheight+1)));
thash_h(params, nodebuffer, nodebuffer, pub_seed, node_addr);
nodeheight++;
treehash->stackusage--;
state->stackoffset--;
}
if (nodeheight == treehash->h) { // this also implies stackusage == 0
memcpy(treehash->node, nodebuffer, params->n);
treehash->completed = 1;
}
else {
memcpy(state->stack + state->stackoffset*params->n, nodebuffer, params->n);
treehash->stackusage++;
state->stacklevels[state->stackoffset] = nodeheight;
state->stackoffset++;
treehash->next_idx++;
}
}
/**
* Performs treehash updates on the instance that needs it the most.
* Returns the updated number of available updates.
**/
static char bds_treehash_update(const xmss_params *params,
bds_state *state, unsigned int updates,
const unsigned char *sk_seed,
unsigned char *pub_seed,
const uint32_t addr[8])
{
uint32_t i, j;
unsigned int level, l_min, low;
unsigned int used = 0;
for (j = 0; j < updates; j++) {
l_min = params->tree_height;
level = params->tree_height - params->bds_k;
for (i = 0; i < params->tree_height - params->bds_k; i++) {
if (state->treehash[i].completed) {
low = params->tree_height;
}
else if (state->treehash[i].stackusage == 0) {
low = i;
}
else {
low = treehash_minheight_on_stack(params, state, &(state->treehash[i]));
}
if (low < l_min) {
level = i;
l_min = low;
}
}
if (level == params->tree_height - params->bds_k) {
break;
}
treehash_update(params, &(state->treehash[level]), state, sk_seed, pub_seed, addr);
used++;
}
return updates - used;
}
/**
* Updates the state (typically NEXT_i) by adding a leaf and updating the stack
* Returns -1 if all leaf nodes have already been processed
**/
static char bds_state_update(const xmss_params *params,
bds_state *state, unsigned char *sk_seed,
const unsigned char *pub_seed,
const uint32_t addr[8])
{
uint32_t ltree_addr[8] = {0};
uint32_t node_addr[8] = {0};
uint32_t ots_addr[8] = {0};
unsigned int nodeh;
int idx = state->next_leaf;
#ifdef FORWARD_SECURE
unsigned char ots_seed[params->n];
#endif
if (idx == 1 << params->tree_height) {
return -1;
}
// only copy layer and tree address parts
copy_subtree_addr(ots_addr, addr);
// type = ots
set_type(ots_addr, 0);
copy_subtree_addr(ltree_addr, addr);
set_type(ltree_addr, 1);
copy_subtree_addr(node_addr, addr);
set_type(node_addr, 2);
set_ots_addr(ots_addr, idx);
set_ltree_addr(ltree_addr, idx);
#ifdef FORWARD_SECURE
hash_prg(params, ots_seed, sk_seed, sk_seed, pub_seed, ots_addr);
gen_leaf_wots(params, state->stack+state->stackoffset*params->n, ots_seed, pub_seed, ltree_addr, ots_addr);
#else
gen_leaf_wots(params, state->stack+state->stackoffset*params->n, sk_seed, pub_seed, ltree_addr, ots_addr);
#endif
state->stacklevels[state->stackoffset] = 0;
state->stackoffset++;
if (params->tree_height - params->bds_k > 0 && idx == 3) {
memcpy(state->treehash[0].node, state->stack+state->stackoffset*params->n, params->n);
}
#ifdef FORWARD_SECURE
unsigned int j;
for(j=0; j < params->tree_height - params->bds_k-1; j++){
int idxtmp = idx;
if(addr[0] == 0) {
idxtmp++;
}
if(idxtmp >> j == 3 && (idxtmp & ((1<<j)-1))==0){
memcpy(state->treehash[j].seed_next, sk_seed, params->n);
}
}
#endif
while (state->stackoffset>1 && state->stacklevels[state->stackoffset-1] == state->stacklevels[state->stackoffset-2]) {
nodeh = state->stacklevels[state->stackoffset-1];
if (idx >> nodeh == 1) {
memcpy(state->auth + nodeh*params->n, state->stack+(state->stackoffset-1)*params->n, params->n);
}
else {
if (nodeh < params->tree_height - params->bds_k && idx >> nodeh == 3) {
memcpy(state->treehash[nodeh].node, state->stack+(state->stackoffset-1)*params->n, params->n);
}
else if (nodeh >= params->tree_height - params->bds_k) {
memcpy(state->retain + ((1 << (params->tree_height - 1 - nodeh)) + nodeh - params->tree_height + (((idx >> nodeh) - 3) >> 1)) * params->n, state->stack+(state->stackoffset-1)*params->n, params->n);
}
}
set_tree_height(node_addr, state->stacklevels[state->stackoffset-1]);
set_tree_index(node_addr, (idx >> (state->stacklevels[state->stackoffset-1]+1)));
thash_h(params, state->stack+(state->stackoffset-2)*params->n, state->stack+(state->stackoffset-2)*params->n, pub_seed, node_addr);
state->stacklevels[state->stackoffset-2]++;
state->stackoffset--;
}
state->next_leaf++;
return 0;
}
/**
* Returns the auth path for node leaf_idx and computes the auth path for the
* next leaf node, using the algorithm described by Buchmann, Dahmen and Szydlo
* in "Post Quantum Cryptography", Springer 2009.
*/
static void bds_round(const xmss_params *params,
bds_state *state, const unsigned long leaf_idx,
const unsigned char *sk_seed,
const unsigned char *pub_seed, uint32_t addr[8])
{
unsigned int i;
unsigned int tau = params->tree_height;
unsigned int startidx;
unsigned int offset, rowidx;
unsigned char buf[2 * params->n];
uint32_t ots_addr[8] = {0};
uint32_t ltree_addr[8] = {0};
uint32_t node_addr[8] = {0};
#ifdef FORWARD_SECURE
unsigned char ots_seed[params->n];
#endif
// only copy layer and tree address parts
copy_subtree_addr(ots_addr, addr);
// type = ots
set_type(ots_addr, 0);
copy_subtree_addr(ltree_addr, addr);
set_type(ltree_addr, 1);
copy_subtree_addr(node_addr, addr);
set_type(node_addr, 2);
for (i = 0; i < params->tree_height; i++) {
if (! ((leaf_idx >> i) & 1)) {
tau = i;
break;
}
}
if (tau > 0) {
memcpy(buf, state->auth + (tau-1) * params->n, params->n);
// we need to do this before refreshing state->keep to prevent overwriting
memcpy(buf + params->n, state->keep + ((tau-1) >> 1) * params->n, params->n);
}
if (!((leaf_idx >> (tau + 1)) & 1) && (tau < params->tree_height - 1)) {
memcpy(state->keep + (tau >> 1)*params->n, state->auth + tau*params->n, params->n);
}
if (tau == 0) {
set_ltree_addr(ltree_addr, leaf_idx);
set_ots_addr(ots_addr, leaf_idx);
#ifdef FORWARD_SECURE
// if lowest layer, generate a new leaf
if(addr[0] == 0){
hash_prg(params, ots_seed, NULL, sk_seed, pub_seed, ots_addr);
gen_leaf_wots(params, state->auth, ots_seed, pub_seed, ltree_addr, ots_addr);
} else {
// otherwise use the cached left leaf (as seed was already deleted)
memcpy(state->auth, state->left_leaf, params->n);
}
#else
gen_leaf_wots(params, state->auth, sk_seed, pub_seed, ltree_addr, ots_addr);
#endif
}
else {
set_tree_height(node_addr, (tau-1));
set_tree_index(node_addr, leaf_idx >> tau);
thash_h(params, state->auth + tau * params->n, buf, pub_seed, node_addr);
for (i = 0; i < tau; i++) {
if (i < params->tree_height - params->bds_k) {
memcpy(state->auth + i * params->n, state->treehash[i].node, params->n);
}
else {
offset = (1 << (params->tree_height - 1 - i)) + i - params->tree_height;
rowidx = ((leaf_idx >> i) - 1) >> 1;
memcpy(state->auth + i * params->n, state->retain + (offset + rowidx) * params->n, params->n);
}
}
for (i = 0; i < ((tau < params->tree_height - params->bds_k) ? tau : (params->tree_height - params->bds_k)); i++) {
startidx = leaf_idx + 1 + 3 * (1 << i);
if (startidx < 1U << params->tree_height) {
state->treehash[i].h = i;
state->treehash[i].next_idx = startidx;
state->treehash[i].completed = 0;
state->treehash[i].stackusage = 0;
#ifdef FORWARD_SECURE
memcpy(state->treehash[i].seed_active, state->treehash[i].seed_next, params->n);
#endif
}
}
}
}
/**
* Given a set of parameters, this function returns the size of the secret key.
* This is implementation specific, as varying choices in tree traversal will
* result in varying requirements for state storage.
*
* This function handles both XMSS and XMSSMT parameter sets.
*/
unsigned long long xmss_xmssmt_core_sk_bytes(const xmss_params *params)
{
return params->index_bytes + 4 * params->n
+ (2 * params->d - 1) * (
(params->tree_height + 1) * params->n
+ 4
+ params->tree_height + 1
+ params->tree_height * params->n
+ (params->tree_height >> 1) * params->n
#ifdef FORWARD_SECURE
+ (params->tree_height - params->bds_k) * (7 + 3*params->n)
+ params->n
#else
+ (params->tree_height - params->bds_k) * (7 + params->n)
#endif
+ ((1 << params->bds_k) - params->bds_k - 1) * params->n
+ 4
)
#ifdef FORWARD_SECURE
+ (2 * params->d - 2) * params->n //seeds
#endif
+ (params->d - 1) * params->wots_sig_bytes;
}
/*
* Generates a XMSS key pair for a given parameter set.
* Format sk: [(32bit) idx || SK_SEED || SK_PRF || root || PUB_SEED]
* Format pk: [root || PUB_SEED] omitting algo oid.
*/
int xmss_core_keypair(const xmss_params *params,
unsigned char *pk, unsigned char *sk)
{
uint32_t addr[8] = {0};
#ifdef FORWARD_SECURE
unsigned char ots_seed[params->n];
#endif
bds_state state;
treehash_inst treehash[params->tree_height - params->bds_k];
state.treehash = treehash;
xmss_deserialize_state(params, &state, sk);
state.stackoffset = 0;
state.next_leaf = 0;
// Set idx = 0
sk[0] = 0;
sk[1] = 0;
sk[2] = 0;
sk[3] = 0;
// Init SK_SEED (n byte) and SK_PRF (n byte)
randombytes(sk + params->index_bytes, 2*params->n);
// Init PUB_SEED (n byte)
randombytes(sk + params->index_bytes + 3*params->n, params->n);
// Copy PUB_SEED to public key
memcpy(pk + params->n, sk + params->index_bytes + 3*params->n, params->n);
// Compute root
#ifdef FORWARD_SECURE
memcpy(ots_seed, sk + params->index_bytes, params->n);
treehash_init(params, pk, params->tree_height, 0, &state, ots_seed, sk + params->index_bytes + 3*params->n, addr);
#else
treehash_init(params, pk, params->tree_height, 0, &state, sk + params->index_bytes, sk + params->index_bytes + 3*params->n, addr);
#endif
// copy root to sk
memcpy(sk + params->index_bytes + 2*params->n, pk, params->n);
/* Write the BDS state into sk. */
xmss_serialize_state(params, sk, &state);
return 0;
}
/**
* Signs a message.
* Returns
* 1. an array containing the signature followed by the message AND
* 2. an updated secret key!
*
*/
int xmss_core_sign(const xmss_params *params,
unsigned char *sk,
unsigned char *sm, unsigned long long *smlen,
const unsigned char *m, unsigned long long mlen)
{
const unsigned char *pub_root = sk + params->index_bytes + 2*params->n;
uint16_t i = 0;
bds_state state;
treehash_inst treehash[params->tree_height - params->bds_k];
state.treehash = treehash;
// Extract index
unsigned long idx = ((unsigned long)sk[0] << 24) | ((unsigned long)sk[1] << 16) | ((unsigned long)sk[2] << 8) | sk[3];
// Check if we can still sign with this sk, return -2 if not:
if (idx >= ((1U << params->tree_height) - 1))
return -2;
/* Load the BDS state from sk. */
xmss_deserialize_state(params, &state, sk);
// Extract remaining SK
unsigned char sk_seed[params->n];
memcpy(sk_seed, sk + params->index_bytes, params->n);
unsigned char sk_prf[params->n];
memcpy(sk_prf, sk + params->index_bytes + params->n, params->n);
unsigned char pub_seed[params->n];
memcpy(pub_seed, sk + params->index_bytes + 3*params->n, params->n);
// index as 32 bytes string
unsigned char idx_bytes_32[32];
ull_to_bytes(idx_bytes_32, 32, idx);
// Update SK
sk[0] = ((idx + 1) >> 24) & 255;
sk[1] = ((idx + 1) >> 16) & 255;
sk[2] = ((idx + 1) >> 8) & 255;
sk[3] = (idx + 1) & 255;
// Secret key for this non-forward-secure version is now updated.
// A production implementation should consider using a file handle instead,
// and write the updated secret key at this point!
// Init working params
unsigned char R[params->n];
unsigned char msg_h[params->n];
unsigned char ots_seed[params->n];
uint32_t ots_addr[8] = {0};
// ---------------------------------
// Message Hashing
// ---------------------------------
// Message Hash:
// First compute pseudorandom value
prf(params, R, idx_bytes_32, sk_prf);
/* Already put the message in the right place, to make it easier to prepend
* things when computing the hash over the message. */
memcpy(sm + params->sig_bytes, m, mlen);
/* Compute the message hash. */
hash_message(params, msg_h, R, pub_root, idx,
sm + params->sig_bytes - 4*params->n, mlen);
// Start collecting signature
*smlen = 0;
// Copy index to signature
sm[0] = (idx >> 24) & 255;
sm[1] = (idx >> 16) & 255;
sm[2] = (idx >> 8) & 255;
sm[3] = idx & 255;
sm += 4;
*smlen += 4;
// Copy R to signature
for (i = 0; i < params->n; i++) {
sm[i] = R[i];
}
sm += params->n;
*smlen += params->n;
// ----------------------------------
// Now we start to "really sign"
// ----------------------------------
// Prepare Address
set_type(ots_addr, 0);
set_ots_addr(ots_addr, idx);
// Compute seed for OTS key pair
#ifdef FORWARD_SECURE
hash_prg(params, ots_seed, sk + params->index_bytes, sk + params->index_bytes, pub_seed, ots_addr);
#else
get_seed(params, ots_seed, sk_seed, ots_addr);
#endif
// Compute WOTS signature
wots_sign(params, sm, msg_h, ots_seed, pub_seed, ots_addr);
sm += params->wots_sig_bytes;
*smlen += params->wots_sig_bytes;
// the auth path was already computed during the previous round
memcpy(sm, state.auth, params->tree_height*params->n);
bds_round(params, &state, idx, sk_seed, pub_seed, ots_addr);
bds_treehash_update(params, &state, (params->tree_height - params->bds_k) >> 1, sk_seed, pub_seed, ots_addr);
sm += params->tree_height*params->n;
*smlen += params->tree_height*params->n;
memcpy(sm, m, mlen);
*smlen += mlen;
#ifdef FORWARD_SECURE
// move forward next seeds for all tree hash instances
for (i = 0; i < params->tree_height-params->bds_k-1; i++) {
set_ots_addr(ots_addr, 1+3*(1<<i)+idx);
hash_prg(params, NULL, state.treehash[i].seed_next, state.treehash[i].seed_next, pub_seed, ots_addr);
}
#endif
/* Write the updated BDS state back into sk. */
xmss_serialize_state(params, sk, &state);
return 0;
}
/*
* Generates a XMSSMT key pair for a given parameter set.
* Format sk: [(ceil(h/8) bit) idx || SK_SEED || SK_PRF || root || PUB_SEED]
* Format pk: [root || PUB_SEED] omitting algo oid.
*/
int xmssmt_core_keypair(const xmss_params *params,
unsigned char *pk, unsigned char *sk)
{
unsigned char ots_seed[params->n];
uint32_t addr[8] = {0};
unsigned int i;
unsigned char *wots_sigs;
bds_state states[2*params->d - 1];
treehash_inst treehash[(2*params->d - 1) * (params->tree_height - params->bds_k)];
for (i = 0; i < 2*params->d - 1; i++) {
states[i].treehash = treehash + i * (params->tree_height - params->bds_k);
}
xmssmt_deserialize_state(params, states, &wots_sigs, sk);
for (i = 0; i < 2 * params->d - 1; i++) {
states[i].stackoffset = 0;
states[i].next_leaf = 0;
}
// Set idx = 0
for (i = 0; i < params->index_bytes; i++) {
sk[i] = 0;
}
#ifdef FORWARD_SECURE
// Init SK_SEED (params->n byte * params->d) and SK_PRF (params->n byte)
randombytes(sk+params->index_bytes, (1 + params->d)*params->n);
// Init PUB_SEED (params->n byte)
randombytes(sk+params->index_bytes + (2 + params->d)*params->n, params->n);
// Copy PUB_SEED to public key
memcpy(pk+params->n, sk+params->index_bytes+ (2 + params->d)*params->n, params->n);
// next seeds contains the seeds for the NEXT_i trees
unsigned char *next_seeds = sk+params->index_bytes+ (3 + params->d)*params->n;
#else
// Init SK_SEED (params->n byte) and SK_PRF (params->n byte)
randombytes(sk+params->index_bytes, 2*params->n);
// Init PUB_SEED (params->n byte)
randombytes(sk+params->index_bytes + 3*params->n, params->n);
// Copy PUB_SEED to public key
memcpy(pk+params->n, sk+params->index_bytes+3*params->n, params->n);
#endif
// Start with the bottom-most layer
set_layer_addr(addr, 0);
// Set up state and compute wots signatures for all but topmost tree root
for (i = 0; i < params->d - 1; i++) {
// Compute seed for OTS key pair
#ifdef FORWARD_SECURE
memcpy(ots_seed, sk+params->index_bytes+i*params->n, params->n);
treehash_init(params, pk, params->tree_height, 0, states + i, ots_seed, pk+params->n, addr);
// treehash_init outputs the seed of the NEXT tree on that layer
memcpy(next_seeds + i * params->n, ots_seed, params->n);
set_layer_addr(addr, (i+1));
hash_prg(params, ots_seed, NULL, sk+params->index_bytes+(i+1)*params->n, pk+params->n, addr);
wots_sign(params, wots_sigs + i*params->wots_sig_bytes, pk, ots_seed, pk+params->n, addr);
unsigned char tmp_wots_leaf[params->n];
uint32_t ltree_addr[8] = {0};
memcpy(ltree_addr, addr, sizeof ltree_addr);
set_type(ltree_addr, 1);
gen_leaf_wots(params, tmp_wots_leaf, ots_seed, pk+params->n, ltree_addr, addr);
memcpy(states[i+1].left_leaf, tmp_wots_leaf, sizeof tmp_wots_leaf);
#else
treehash_init(params, pk, params->tree_height, 0, states + i, sk+params->index_bytes, pk+params->n, addr);
set_layer_addr(addr, (i+1));
get_seed(params, ots_seed, sk + params->index_bytes, addr);
wots_sign(params, wots_sigs + i*params->wots_sig_bytes, pk, ots_seed, pk+params->n, addr);
#endif
}
// Address now points to the single tree on layer d-1
#ifdef FORWARD_SECURE
memcpy(ots_seed, sk+params->index_bytes+(params->d - 1)*params->n, params->n);
treehash_init(params, pk, params->tree_height, 0, states + i, ots_seed, pk+params->n, addr);
memcpy(sk + params->index_bytes + (1+params->d)*params->n, pk, params->n);
set_tree_addr(addr, 0);
set_ots_addr(addr, 0);
for (i = 1; i < params->d; i++) {
set_layer_addr(addr, i);
hash_prg(params, NULL, sk+params->index_bytes+i*params->n, sk+params->index_bytes+i*params->n, pk+params->n, addr);
}
#else
treehash_init(params, pk, params->tree_height, 0, states + i, sk+params->index_bytes, pk+params->n, addr);
memcpy(sk + params->index_bytes + 2*params->n, pk, params->n);
#endif
xmssmt_serialize_state(params, sk, states);
return 0;
}
/**
* Signs a message.
* Returns
* 1. an array containing the signature followed by the message AND
* 2. an updated secret key!
*
*/
int xmssmt_core_sign(const xmss_params *params,
unsigned char *sk,
unsigned char *sm, unsigned long long *smlen,
const unsigned char *m, unsigned long long mlen)
{
#ifdef FORWARD_SECURE
const unsigned char *pub_root = sk + params->index_bytes + (1 + params->d)*params->n;
unsigned char *next_seeds = sk + params->index_bytes + (3 + params->d)*params->n;
#else
const unsigned char *pub_root = sk + params->index_bytes + 2*params->n;
#endif
uint64_t idx_tree;
uint32_t idx_leaf;
uint64_t i, j;
int needswap_upto = -1;
unsigned int updates;
unsigned char sk_seed[params->n];
unsigned char sk_prf[params->n];
unsigned char pub_seed[params->n];
// Init working params
unsigned char R[params->n];
unsigned char msg_h[params->n];
unsigned char ots_seed[params->n];
uint32_t addr[8] = {0};
uint32_t ots_addr[8] = {0};
unsigned char idx_bytes_32[32];
unsigned char *wots_sigs;
bds_state states[2*params->d - 1];
treehash_inst treehash[(2*params->d - 1) * (params->tree_height - params->bds_k)];
for (i = 0; i < 2*params->d - 1; i++) {
states[i].treehash = treehash + i * (params->tree_height - params->bds_k);
}
xmssmt_deserialize_state(params, states, &wots_sigs, sk);
// Extract SK
unsigned long long idx = 0;
for (i = 0; i < params->index_bytes; i++) {
idx |= ((unsigned long long)sk[i]) << 8*(params->index_bytes - 1 - i);
}
// Check if we can still sign with this sk, return -2 if not:
if (idx >= ((1ULL << params->full_height) - 1))
return -2;
memcpy(sk_seed, sk+params->index_bytes, params->n);
#ifdef FORWARD_SECURE
memcpy(sk_prf, sk+params->index_bytes+params->d*params->n, params->n);
memcpy(pub_seed, sk+params->index_bytes+(2+params->d)*params->n, params->n);
#else
memcpy(sk_prf, sk+params->index_bytes+params->n, params->n);
memcpy(pub_seed, sk+params->index_bytes+3*params->n, params->n);
#endif