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
|
/*
*
* Wireless daemon for Linux
*
* Copyright (C) 2013-2019 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 <config.h>
#endif
#include <stdio.h>
#include <string.h>
#include <assert.h>
#include <ell/ell.h>
#include "src/crypto.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[1024];
unsigned int i;
bool result;
prf_len = strlen(test->prf) / 2;
printf("PRF = %s (%d octets)\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",
};
static bool test_precheck(const void *data)
{
return l_checksum_is_supported(L_CHECKSUM_SHA1, true);
}
#define add_test(name, func, data) l_test_add_data_func_precheck(name, data, \
func, test_precheck, 0)
int main(int argc, char *argv[])
{
l_test_init(&argc, &argv);
add_test("/prf-sha1/Test case 1", prf_test, &test_case_1);
add_test("/prf-sha1/Test case 2", prf_test, &test_case_2);
add_test("/prf-sha1/Test case 3", prf_test, &test_case_3);
return l_test_run();
}
|
