denozord/strongswan-ext
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

index limit can be easily computed

Browse Source
This commit is contained in:
Andreas Steffen
2014-02-19 20:18:53 +01:00
parent ab13364c65
commit e80014f1e8
6 changed files with 28 additions and 54 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/libstrongswan/tests/suites/test_ntru.c
+10 -12
View File
@@ -33,8 +33,8 @@ IMPORT_FUNCTION_FOR_TESTS(ntru, ntru_trits_create, ntru_trits_t*,
IMPORT_FUNCTION_FOR_TESTS(ntru, ntru_poly_create, ntru_poly_t*,
hash_algorithm_t alg, chunk_t seed, uint8_t c_bits,
uint16_t limit, uint16_t poly_len,
uint32_t indices_count, bool is_product_form)
uint16_t poly_len, uint32_t indices_count,
bool is_product_form)
/**
* NTRU parameter sets to test
@@ -302,7 +302,6 @@ END_TEST
typedef struct {
uint8_t c_bits;
uint16_t limit;
uint16_t poly_len;
bool is_product_form;
uint32_t indices_count;
@@ -428,10 +427,10 @@ mgf1_test_t mgf1_tests[] = {
0, 1, 1, 2, 0, 2, 2, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1,
0, 1, 2, 0, 1, 1, 0, 1, 2, 0, 0, 1, 2, 2, 0, 0, 2, 1, 2),
{
{ 9, 439, 439, TRUE, 2*(9 + (8 << 8) + (5 << 16)),
{ 9, 439, TRUE, 2*(9 + (8 << 8) + (5 << 16)),
countof(indices_ees439ep1), indices_ees439ep1
},
{ 11, 1839, 613, FALSE, 2*55,
{ 11, 613, FALSE, 2*55,
countof(indices_ees613ep1), indices_ees613ep1
}
}
@@ -515,10 +514,10 @@ mgf1_test_t mgf1_tests[] = {
1, 0, 1, 0, 2, 2, 1, 0, 2, 2, 2, 2, 2, 1, 0, 2, 2, 2, 1, 2,
0, 2, 0, 0, 0, 0, 0, 1, 2, 0, 1, 0, 1),
{
{ 13, 8173, 743, TRUE, 2*(11 + (11 << 8) + (15 << 16)),
{ 13, 743, TRUE, 2*(11 + (11 << 8) + (15 << 16)),
countof(indices_ees743ep1), indices_ees743ep1
},
{ 12, 3513, 1171, FALSE, 2*106,
{ 12, 1171, FALSE, 2*106,
countof(indices_ees1171ep1), indices_ees1171ep1
}
}
@@ -633,16 +632,15 @@ START_TEST(test_ntru_poly)
seed.len = mgf1_tests[_i].seed_len;
p = &mgf1_tests[_i].poly_test[0];
poly = ntru_poly_create(HASH_UNKNOWN, seed, p->c_bits, p->limit,
p->poly_len, p->indices_count, p->is_product_form);
poly = ntru_poly_create(HASH_UNKNOWN, seed, p->c_bits, p->poly_len,
p->indices_count, p->is_product_form);
ck_assert(poly == NULL);
for (n = 0; n < 2; n++)
{
p = &mgf1_tests[_i].poly_test[n];
poly = ntru_poly_create(mgf1_tests[_i].alg, seed, p->c_bits, p->limit,
p->poly_len, p->indices_count,
p->is_product_form);
poly = ntru_poly_create(mgf1_tests[_i].alg, seed, p->c_bits, p->poly_len,
p->indices_count, p->is_product_form);
ck_assert(poly != NULL && poly->get_size(poly) == p->indices_len);
indices = poly->get_indices(poly);