kris/xmss-KAT-generator
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Use proper size limits for state structures

Browse Source
This commit is contained in:
Joost Rijneveld 2015-10-05 21:59:50 +02:00
parent 2af61cea82
commit 594d67aeb9
1 changed files with 18 additions and 15 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

33
test/test_xmssmt_fast.c
View File

@ -4,7 +4,7 @@
#include "../xmss_fast.h" #include "../xmss_fast.h"
#define MLEN 3491 #define MLEN 3491
#define SIGNATURES 1024 #define SIGNATURES 4096
unsigned char mi[MLEN]; unsigned char mi[MLEN];
@ -17,8 +17,8 @@ int main()
unsigned long long i,j; unsigned long long i,j;
int m = 32; int m = 32;
int n = 32; int n = 32;
int h = 20; int h = 12;
int d = 5; int d = 2;
int w = 16; int w = 16;
int k = 2; int k = 2;
@ -28,24 +28,27 @@ int main()
return 1; return 1;
} }
unsigned char stack[2*d * (h-k-1)*n]; unsigned int tree_h = h / d;
unsigned char stacklevels[2*d * (h-k-1)];
unsigned char auth[2*d * h*n]; // stack needs to be larger than regular (H-K-1), since we re-use for 'next'
unsigned char keep[2*d * (h >> 1)*n]; unsigned char stack[2*d * (tree_h + 1)*n];
treehash_inst treehash[2*d * (h-k)]; unsigned char stacklevels[2*d * (tree_h + 1)*n];
unsigned char th_nodes[2*d * (h-k)*n]; unsigned char auth[2*d * tree_h*n];
unsigned char keep[2*d * (tree_h >> 1)*n];
treehash_inst treehash[2*d * (tree_h-k)];
unsigned char th_nodes[2*d * (tree_h-k)*n];
unsigned char retain[2*d * ((1 << k) - k - 1)*n]; unsigned char retain[2*d * ((1 << k) - k - 1)*n];
unsigned char wots_sigs[d * params->xmss_par.wots_par.keysize]; unsigned char wots_sigs[d * params->xmss_par.wots_par.keysize];
bds_state states[2*d]; // first d are 'regular' states, second d are 'next' bds_state states[2*d]; // first d are 'regular' states, second d are 'next'
for (i = 0; i < 2*d; i++) { for (i = 0; i < 2*d; i++) {
for(j=0;j<h-k;j++) for(j=0;j<tree_h-k;j++)
treehash[i*(h-k) + j].node = th_nodes + (i*(h-k) + j) * n; treehash[i*(tree_h-k) + j].node = th_nodes + (i*(tree_h-k) + j) * n;
xmss_set_bds_state(states + i, xmss_set_bds_state(states + i,
stack + i*(h-k-1)*n, 0, stacklevels + i*(h-k-1), stack + i*(tree_h + 1)*n, 0, stacklevels + i*(tree_h + 1),
auth + i*h*n, auth + i*tree_h*n,
keep + i*(h >> 1)*n, keep + i*(tree_h >> 1)*n,
treehash + i*(h-k), treehash + i*(tree_h-k),
retain + i*((1 << k) - k - 1)*n, retain + i*((1 << k) - k - 1)*n,
0 0
); );