aboutsummaryrefslogtreecommitdiffstats
path: root/Source/charon/testcases/hasher_test.c
blob: fdb3714dc05a13b1a4e62fe6a333e51f2835b519 (plain)
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
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
/**
 * @file hasher_test.h
 * 
 * @brief Tests for the hasher_t classes.
 * 
 */

/*
 * Copyright (C) 2005 Jan Hutter, Martin Willi
 * Hochschule fuer Technik Rapperswil
 *
 * This program is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License as published by the
 * Free Software Foundation; either version 2 of the License, or (at your
 * option) any later version.  See <http://www.fsf.org/copyleft/gpl.txt>.
 *
 * This program 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 General Public License
 * for more details.
 */

#include <string.h>
 
#include "hasher_test.h"

#include <utils/allocator.h>


/* 
 * described in Header-File
 */
void test_md5_hasher(tester_t *tester)
{
	/*
	 * Test vectors from RFC1321:
	 * MD5 ("") = d41d8cd98f00b204e9800998ecf8427e
	 * MD5 ("a") = 0cc175b9c0f1b6a831c399e269772661
	 * MD5 ("abc") = 900150983cd24fb0d6963f7d28e17f72
	 * MD5 ("message digest") = f96b697d7cb7938d525a2f31aaf161d0
	 * MD5 ("abcdefghijklmnopqrstuvwxyz") = c3fcd3d76192e4007dfb496cca67e13b
	 * 
	 * currently testing "", "abc", "abcdefghijklmnopqrstuvwxyz"
	 */	
	hasher_t *hasher = hasher_create(HASH_MD5);
	u_int8_t hash_buffer[16];
	chunk_t empty, abc, abcd, hash_chunk;
	
	u_int8_t hash_empty[] = {
		0xd4,0x1d,0x8c,0xd9,
		0x8f,0x00,0xb2,0x04,
		0xe9,0x80,0x09,0x98,
		0xec,0xf8,0x42,0x7e
	};
		
	u_int8_t hash_abc[] = {
		0x90,0x01,0x50,0x98,
		0x3c,0xd2,0x4f,0xb0,
		0xd6,0x96,0x3f,0x7d,
		0x28,0xe1,0x7f,0x72
	};
		
	u_int8_t hash_abcd[] = {
		0xc3,0xfc,0xd3,0xd7,
		0x61,0x92,0xe4,0x00,
		0x7d,0xfb,0x49,0x6c,
		0xca,0x67,0xe1,0x3b
	};

	empty.ptr = "";
	empty.len = 0;
	abc.ptr = "abc";
	abc.len = 3;
	abcd.ptr = "abcdefghijklmnopqrstuvwxyz";
	abcd.len = strlen(abcd.ptr);
	
	tester->assert_true(tester, hasher->get_block_size(hasher) == 16, "block size");
	
	/* simple hashing, using empty */
	hasher->get_hash(hasher, empty, hash_buffer);
	tester->assert_false(tester, memcmp(hash_buffer, hash_empty, 16), "hash for empty");
	
	/* simple hashing, using "abc" */
	hasher->get_hash(hasher, abc, hash_buffer);
	tester->assert_false(tester, memcmp(hash_buffer, hash_abc, 16), "hash for abc");
	
	/* with allocation, using "abcdb..." */
	hasher->reset(hasher);
	hasher->allocate_hash(hasher, abcd, &hash_chunk);
	tester->assert_true(tester, hash_chunk.len == 16, "hash len");
	tester->assert_false(tester, memcmp(hash_chunk.ptr, hash_abcd, hash_chunk.len), "hash for abcd...");
	allocator_free(hash_chunk.ptr);
	hasher->destroy(hasher);
}

/* 
 * described in Header-File
 */
void test_sha1_hasher(tester_t *tester)
{
	/*
	* 	Test Vectors (from FIPS PUB 180-1)
	* 	"abc"
	*	A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D
	* 	"abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
	*   84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1
	* 	A million repetitions of "a"
	*   34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F
	*/	
	hasher_t *hasher = hasher_create(HASH_SHA1);
	u_int8_t hash_buffer[20];
	chunk_t abc, abcdb, aaa, hash_chunk;
	u_int32_t i;
	u_int8_t hash_abc[] = {	
		0xA9,0x99,0x3E,0x36,
		0x47,0x06,0x81,0x6A,
		0xBA,0x3E,0x25,0x71,
		0x78,0x50,0xC2,0x6C,
		0x9C,0xD0,0xD8,0x9D
	};   	
	u_int8_t hash_abcdb[] = {	
		0x84,0x98,0x3E,0x44,
		0x1C,0x3B,0xD2,0x6E,
		0xBA,0xAE,0x4A,0xA1,
		0xF9,0x51,0x29,0xE5,
		0xE5,0x46,0x70,0xF1
	}; 	
	u_int8_t hash_aaa[] = {	
		0x34,0xAA,0x97,0x3C,
		0xD4,0xC4,0xDA,0xA4,
		0xF6,0x1E,0xEB,0x2B,
		0xDB,0xAD,0x27,0x31,
		0x65,0x34,0x01,0x6F
	};
	abc.ptr = "abc";
	abc.len = 3;
	abcdb.ptr = "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq";
	abcdb.len = strlen(abcdb.ptr);
	aaa.ptr = "aaaaaaaaaa"; /* 10 a's */
	aaa.len = 10;
	
	tester->assert_true(tester, hasher->get_block_size(hasher) == 20, "block size");
	
	/* simple hashing, using "abc" */
	hasher->get_hash(hasher, abc, hash_buffer);
	tester->assert_false(tester, memcmp(hash_buffer, hash_abc, 20), "hash for abc");
	
	/* with allocation, using "abcdb..." */
	hasher->reset(hasher);
	hasher->allocate_hash(hasher, abcdb, &hash_chunk);
	tester->assert_true(tester, hash_chunk.len == 20, "chunk len");
	tester->assert_false(tester, memcmp(hash_chunk.ptr, hash_abcdb, hash_chunk.len), "hash for abcdb...");
	allocator_free(hash_chunk.ptr);
	
	/* updating, using "aaaaaaa..." */
	hasher->reset(hasher);
	for(i=0; i<100000; i++)
	{
		if (i != 99999)
		{
			hasher->get_hash(hasher, aaa, NULL);
		}
		else
		{
			hasher->get_hash(hasher, aaa, hash_buffer);
		} 
	}
	tester->assert_false(tester, memcmp(hash_buffer, hash_aaa, 20), "hash for aaa...");
	

	hasher->destroy(hasher);
}