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
|
/* $OpenBSD: prftest.c,v 1.7 2003/06/03 14:39:51 ho Exp $ */
/* $EOM: prftest.c,v 1.2 1998/10/07 16:40:50 niklas Exp $ */
/*
* Copyright (c) 1998 Niels Provos. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/*
* This code was written under funding by Ericsson Radio Systems.
*/
#include <sys/param.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include "hash.h"
#include "prf.h"
int test_prf (char *, enum hashes, char *, int, char *, int, char *);
#define nibble2c(x) ((x) >= 10 ? ('a'-10+(x)) : ('0' + (x)))
/*
* Basically the same as the HMAC regress, but to keep with modularity
* prf seems to be useful. So here we just check the HMAC test cases,
* until there are more PRFs.
*/
int
main (void)
{
char key[100];
memset (key, 11, 20);
test_prf ("PRF MD5 Test Case 1", HASH_MD5,
key, 16, "Hi There", 8, "9294727a3638bb1c13f48ef8158bfc9d");
test_prf ("PRF MD5 Test Case 2", HASH_MD5,
"Jefe", 4,
"what do ya want for nothing?", 28,
"750c783e6ab0b503eaa86e310a5db738");
test_prf ("PRF SHA1 Test Case 1", HASH_SHA1,
key, 20, "Hi There", 8,
"b617318655057264e28bc0b6fb378c8ef146be00");
test_prf ("PRF SHA1 Test Case 2", HASH_SHA1,
"Jefe", 4, "what do ya want for nothing?", 28,
"effcdf6ae5eb2fa2d27416d5f184df9c259a7c79");
test_prf ("PRF SHA1 Test Case 3", HASH_SHA1,
"Bloody long key, this one, eben longer than the blocksize "
"of ordinary keyed HMAC functions", 90,
"what do ya want for nothing?", 28,
"52ca5fbcd7d4821bc6bf8b6e95e131109dff901b");
return 0;
}
int
test_prf (char *test, enum hashes hash, char *key, int klen,
char *data, int dlen, char *cmp)
{
char output[2*HASH_MAX+1];
char digest[HASH_MAX];
struct prf *prf;
int i;
printf ("Testing %s: ", test);
prf = prf_alloc (PRF_HMAC, hash, key, klen);
if (!prf)
{
printf("prf_alloc () failed\n");
return 0;
}
prf->Init (prf->prfctx);
prf->Update (prf->prfctx, data, dlen);
prf->Final (digest, prf->prfctx);
prf_free (prf);
for (i = 0; i < prf->blocksize; i++)
{
output[2 * i] = nibble2c ((digest[i] >> 4) & 0xf);
output[2 * i + 1] = nibble2c (digest[i] & 0xf);
}
output[2 * i] = 0;
if (strcmp (output, cmp) == 0)
{
printf ("OKAY\n");
return 1;
}
printf ("%s <-> %s\n", output, cmp);
return 0;
}
|
