From 2286890184d29d31bde387243b3196e5da1d45bc Mon Sep 17 00:00:00 2001 From: Marcel Holtmann Date: Sun, 11 May 2014 11:46:32 -0700 Subject: [PATCH] unit: Add SHA-1 versions of PBKDF2 and PRF test cases --- .gitignore | 5 + Makefile.am | 12 ++ unit/test-pbkdf2-sha1.c | 302 ++++++++++++++++++++++++++++++++++++++++ unit/test-prf-sha1.c | 125 +++++++++++++++++ 4 files changed, 444 insertions(+) create mode 100644 unit/test-pbkdf2-sha1.c create mode 100644 unit/test-prf-sha1.c diff --git a/.gitignore b/.gitignore index 2d3c45ed..7532a7af 100644 --- a/.gitignore +++ b/.gitignore @@ -20,3 +20,8 @@ autom4te.cache ell src/iwd client/iwctl +unit/test-pbkdf2-sha1 +unit/test-prf-sha1 +unit/*.log +unit/*.trs +test-suite.log diff --git a/Makefile.am b/Makefile.am index dedcde45..ff98ab54 100644 --- a/Makefile.am +++ b/Makefile.am @@ -36,6 +36,18 @@ src_iwd_LDADD = ell/libell-internal.la client_iwctl_SOURCES = client/main.c client_iwctl_LDADD = ell/libell-internal.la +noinst_PROGRAMS = unit/test-pbkdf2-sha1 unit/test-prf-sha1 + +unit_test_pbkdf2_sha1_SOURCES = unit/test-pbkdf2-sha1.c \ + src/sha1.h src/sha1.c +unit_test_pbkdf2_sha1_LDADD = ell/libell-internal.la + +unit_test_prf_sha1_SOURCES = unit/test-prf-sha1.c \ + src/sha1.h src/sha1.c +unit_test_prf_sha1_LDADD = ell/libell-internal.la + +TESTS = $(noinst_PROGRAMS) + AM_CFLAGS = -fvisibility=hidden MAINTAINERCLEANFILES = Makefile.in configure config.h.in aclocal.m4 diff --git a/unit/test-pbkdf2-sha1.c b/unit/test-pbkdf2-sha1.c new file mode 100644 index 00000000..35cfaa8b --- /dev/null +++ b/unit/test-pbkdf2-sha1.c @@ -0,0 +1,302 @@ +/* + * + * Wireless daemon for Linux + * + * Copyright (C) 2013-2014 Intel Corporation. All rights reserved. + * + * This library is free software; you can redistribute it and/or + * modify it under the terms of the GNU Lesser General Public + * License as published by the Free Software Foundation; either + * version 2.1 of the License, or (at your option) any later version. + * + * This library 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 + * Lesser General Public License for more details. + * + * You should have received a copy of the GNU Lesser General Public + * License along with this library; if not, write to the Free Software + * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA + * + */ + +#ifdef HAVE_CONFIG_H +#include +#endif + +#include +#include +#include +#include + +#include "src/sha1.h" + +struct pbkdf2_data { + const char *password; + unsigned int password_len; + const char *salt; + unsigned int salt_len; + unsigned int count; + unsigned int key_len; + const char *key; +}; + +static void pbkdf2_test(const void *data) +{ + const struct pbkdf2_data *test = data; + unsigned int password_len; + unsigned int salt_len; + unsigned int key_len; + unsigned char output[25]; + char key[50]; + unsigned int i; + bool result; + + password_len = test->password_len ? : strlen(test->password); + salt_len = test->salt_len ? : strlen(test->salt); + + key_len = test->key_len ? : (strlen(test->key) / 2); + + printf("Password = \"%s\" (%d octects)\n", + test->password, password_len); + printf("Salt = \"%s\" (%d octects)\n", + test->salt, salt_len); + printf("Count = %d\n", test->count); + printf("Key = %s (%d octects)\n", test->key, key_len); + + result = pbkdf2_sha1(test->password, password_len, + test->salt, salt_len, + test->count, output, key_len); + + assert(result == true); + + for (i = 0; i < key_len; i++) + sprintf(key + (i * 2), "%02x", output[i]); + + printf("Result = %s\n", key); + + assert(strcmp(test->key, key) == 0); +} + +static const struct pbkdf2_data pbkdf2_test_vector_1 = { + .password = "password", + .salt = "salt", + .count = 1, + .key = "0c60c80f961f0e71f3a9b524af6012062fe037a6", + .key_len = 20, +}; + +static const struct pbkdf2_data pbkdf2_test_vector_2 = { + .password = "password", + .salt = "salt", + .count = 2, + .key = "ea6c014dc72d6f8ccd1ed92ace1d41f0d8de8957", + .key_len = 20, +}; + +static const struct pbkdf2_data pbkdf2_test_vector_3 = { + .password = "password", + .salt = "salt", + .count = 4096, + .key = "4b007901b765489abead49d926f721d065a429c1", + .key_len = 20, +}; + +static const struct pbkdf2_data pbkdf2_test_vector_4 = { + .password = "password", + .salt = "salt", + .count = 16777216, + .key = "eefe3d61cd4da4e4e9945b3d6ba2158c2634e984", + .key_len = 20, +}; + +static const struct pbkdf2_data pbkdf2_test_vector_5 = { + .password = "passwordPASSWORDpassword", + .salt = "saltSALTsaltSALTsaltSALTsaltSALTsalt", + .count = 4096, + .key = "3d2eec4fe41c849b80c8d83662c0e44a8b291a964cf2f07038", + .key_len = 25, +}; + +static const struct pbkdf2_data pbkdf2_test_vector_6 = { + .password = "pass\0word", + .password_len = 9, + .salt = "sa\0lt", + .salt_len = 5, + .count = 4096, + .key = "56fa6aa75548099dcc37d7f03425e0c3", + .key_len = 16, +}; + +static const struct pbkdf2_data athena_test_vector_1 = { + .password = "password", + .salt = "ATHENA.MIT.EDUraeburn", + .count = 1, + .key = "cdedb5281bb2f801565a1122b2563515", +}; + +static const struct pbkdf2_data athena_test_vector_2 = { + .password = "password", + .salt = "ATHENA.MIT.EDUraeburn", + .count = 2, + .key = "01dbee7f4a9e243e988b62c73cda935d", +}; + +static const struct pbkdf2_data athena_test_vector_3 = { + .password = "password", + .salt = "ATHENA.MIT.EDUraeburn", + .count = 1200, + .key = "5c08eb61fdf71e4e4ec3cf6ba1f5512b", +}; + +static const struct pbkdf2_data athena_test_vector_4 = { + .password = "password", + .salt = "\x12\x34\x56\x78\x78\x56\x34\x12", + .count = 5, + .key = "d1daa78615f287e6a1c8b120d7062a49", +}; + +static const struct pbkdf2_data athena_test_vector_5 = { + .password = "XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX" + "XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX", + .salt = "pass phrase equals block size", + .count = 1200, + .key = "139c30c0966bc32ba55fdbf212530ac9", +}; + +static const struct pbkdf2_data athena_test_vector_6 = { + .password = "XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX" + "XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX", + .salt = "pass phrase exceeds block size", + .count = 1200, + .key = "9ccad6d468770cd51b10e6a68721be61", +}; + +static const struct pbkdf2_data athena_test_vector_7 = { + .password = "\xf0\x9d\x84\x9e", /* g-clef (0xf09d849e) */ + .salt = "EXAMPLE.COMpianist", + .count = 50, + .key = "6b9cf26d45455a43a5b8bb276a403b39", +}; + +struct psk_data { + const char *passphrase; + const unsigned char *ssid; + size_t ssid_len; + const char *network; + const char *psk; +}; + +static void psk_test(const void *data) +{ + const struct psk_data *test = data; + unsigned char ssid[32]; + size_t ssid_len; + unsigned char output[32]; + char psk[65]; + unsigned int i; + bool result; + + if (test->network == NULL) { + memcpy(ssid, test->ssid, test->ssid_len); + ssid_len = test->ssid_len; + } else { + ssid_len = strlen(test->network); + memcpy(ssid, test->network, ssid_len); + } + + printf("Passphrase = \"%s\"\n", test->passphrase); + printf("SSID = {"); + for (i = 0; i < ssid_len; i++) + printf("%s'%c'", i == 0 ? " " : ", ", ssid[i]); + printf(" }\n"); + printf("SSID Length = %ld\n", ssid_len); + printf("PSK = %s\n", test->psk); + + result = pbkdf2_sha1(test->passphrase, strlen(test->passphrase), + ssid, ssid_len, 4096, + output, sizeof(output)); + + assert(result == true); + + for (i = 0; i < sizeof(output); i++) + sprintf(psk + (i * 2), "%02x", output[i]); + + printf("Result = %s\n", psk); + + assert(strcmp(test->psk, psk) == 0); +} + +static const unsigned char psk_test_case_1_ssid[] = { 'I', 'E', 'E', 'E' }; + +static const struct psk_data psk_test_case_1 = { + .passphrase = "password", + .ssid = psk_test_case_1_ssid, + .ssid_len = sizeof(psk_test_case_1_ssid), + .psk = "f42c6fc52df0ebef9ebb4b90b38a5f90" + "2e83fe1b135a70e23aed762e9710a12e", +}; + +static const unsigned char psk_test_case_2_ssid[] = { 'T', 'h', 'i', 's', + 'I', 's', 'A', 'S', 'S', 'I', 'D' }; + +static const struct psk_data psk_test_case_2 = { + .passphrase = "ThisIsAPassword", + .ssid = psk_test_case_2_ssid, + .ssid_len = sizeof(psk_test_case_2_ssid), + .psk = "0dc0d6eb90555ed6419756b9a15ec3e3" + "209b63df707dd508d14581f8982721af", +}; + +static const unsigned char psk_test_case_3_ssid[] = { + 'Z', 'Z', 'Z', 'Z', 'Z', 'Z', 'Z', 'Z', + 'Z', 'Z', 'Z', 'Z', 'Z', 'Z', 'Z', 'Z', + 'Z', 'Z', 'Z', 'Z', 'Z', 'Z', 'Z', 'Z', + 'Z', 'Z', 'Z', 'Z', 'Z', 'Z', 'Z', 'Z' }; + +static const struct psk_data psk_test_case_3 = { + .passphrase = "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", + .ssid = psk_test_case_3_ssid, + .ssid_len = sizeof(psk_test_case_3_ssid), + .psk = "becb93866bb8c3832cb777c2f559807c" + "8c59afcb6eae734885001300a981cc62", +}; + +int main(int argc, char *argv[]) +{ + l_test_init(&argc, &argv); + + l_test_add("/pbkdf2-sha1/PBKDF2 Test vector 1", + pbkdf2_test, &pbkdf2_test_vector_1); + l_test_add("/pbkdf2-sha1/PBKDF2 Test vector 2", + pbkdf2_test, &pbkdf2_test_vector_2); + l_test_add("/pbkdf2-sha1/PBKDF2 Test vector 3", + pbkdf2_test, &pbkdf2_test_vector_3); + l_test_add("/pbkdf2-sha1/PBKDF2 Test vector 4", + pbkdf2_test, &pbkdf2_test_vector_4); + l_test_add("/pbkdf2-sha1/PBKDF2 Test vector 5", + pbkdf2_test, &pbkdf2_test_vector_5); + l_test_add("/pbkdf2-sha1/PBKDF2 Test vector 6", + pbkdf2_test, &pbkdf2_test_vector_6); + + l_test_add("/pbkdf2-sha1/ATHENA Test vector 1", + pbkdf2_test, &athena_test_vector_1); + l_test_add("/pbkdf2-sha1/ATHENA Test vector 2", + pbkdf2_test, &athena_test_vector_2); + l_test_add("/pbkdf2-sha1/ATHENA Test vector 3", + pbkdf2_test, &athena_test_vector_3); + l_test_add("/pbkdf2-sha1/ATHENA Test vector 4", + pbkdf2_test, &athena_test_vector_4); + l_test_add("/pbkdf2-sha1/ATHENA Test vector 5", + pbkdf2_test, &athena_test_vector_5); + l_test_add("/pbkdf2-sha1/ATHENA Test vector 6", + pbkdf2_test, &athena_test_vector_6); + l_test_add("/pbkdf2-sha1/ATHENA Test vector 7", + pbkdf2_test, &athena_test_vector_7); + + l_test_add("/pbkdf2-sha1/PSK Test case 1", psk_test, &psk_test_case_1); + l_test_add("/pbkdf2-sha1/PSK Test case 2", psk_test, &psk_test_case_2); + l_test_add("/pbkdf2-sha1/PSK Test case 3", psk_test, &psk_test_case_3); + + return l_test_run(); +} diff --git a/unit/test-prf-sha1.c b/unit/test-prf-sha1.c new file mode 100644 index 00000000..63ecc485 --- /dev/null +++ b/unit/test-prf-sha1.c @@ -0,0 +1,125 @@ +/* + * + * Wireless daemon for Linux + * + * Copyright (C) 2013-2014 Intel Corporation. All rights reserved. + * + * This library is free software; you can redistribute it and/or + * modify it under the terms of the GNU Lesser General Public + * License as published by the Free Software Foundation; either + * version 2.1 of the License, or (at your option) any later version. + * + * This library 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 + * Lesser General Public License for more details. + * + * You should have received a copy of the GNU Lesser General Public + * License along with this library; if not, write to the Free Software + * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA + * + */ + +#ifdef HAVE_CONFIG_H +#include +#endif + +#include +#include +#include +#include + +#include "src/sha1.h" + +struct prf_data { + const char *key; + unsigned int key_len; + const char *prefix; + unsigned int prefix_len; + const char *data; + unsigned int data_len; + const char *prf; +}; + +static void prf_test(const void *data) +{ + const struct prf_data *test = data; + unsigned int prf_len; + unsigned char output[512]; + char prf[128]; + unsigned int i; + bool result; + + prf_len = strlen(test->prf) / 2; + + printf("PRF = %s (%d octects)\n", test->prf, prf_len); + + result = prf_sha1(test->key, test->key_len, test->prefix, + test->prefix_len, test->data, test->data_len, + output, prf_len); + + assert(result == true); + + for (i = 0; i < prf_len; i++) + sprintf(prf + (i * 2), "%02x", output[i]); + + printf("Result = %s\n", prf); + + assert(strcmp(test->prf, prf) == 0); +} + +static const struct prf_data test_case_1 = { + .key = "\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b" + "\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b", + .key_len = 20, + .prefix = "prefix", + .prefix_len = 6, + .data = "Hi There", + .data_len = 8, + .prf = "bcd4c650b30b9684951829e0d75f9d54" + "b862175ed9f00606e17d8da35402ffee" + "75df78c3d31e0f889f012120c0862beb" + "67753e7439ae242edb8373698356cf5a", +}; + +static const struct prf_data test_case_2 = { + .key = "Jefe", + .key_len = 4, + .prefix = "prefix", + .prefix_len = 6, + .data = "what do ya want for nothing?", + .data_len = 28, + .prf = "51f4de5b33f249adf81aeb713a3c20f4" + "fe631446fabdfa58244759ae58ef9009" + "a99abf4eac2ca5fa87e692c440eb4002" + "3e7babb206d61de7b92f41529092b8fc", +}; + +static const struct prf_data test_case_3 = { + .key = "\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa" + "\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa", + .key_len = 20, + .prefix = "prefix", + .prefix_len = 6, + .data = "\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd" + "\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd" + "\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd" + "\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd" + "\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd", + .data_len = 50, + .prf = "e1ac546ec4cb636f9976487be5c86be1" + "7a0252ca5d8d8df12cfb0473525249ce" + "9dd8d177ead710bc9b590547239107ae" + "f7b4abd43d87f0a68f1cbd9e2b6f7607", +}; + +int main(int argc, char *argv[]) +{ + l_test_init(&argc, &argv); + + l_test_add("/prf-sha1/Test case 1", prf_test, &test_case_1); + l_test_add("/prf-sha1/Test case 2", prf_test, &test_case_2); + l_test_add("/prf-sha1/Test case 3", prf_test, &test_case_3); + + return l_test_run(); +}