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
|
/*
* Ouroboros - Copyright (C) 2016 - 2021
*
* Test of the MD5 function
*
* Dimitri Staessens <dimitri.staessens@ugent.be>
* Sander Vrijders <sander.vrijders@ugent.be>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2 as
* published by the Free Software Foundation.
*
* 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.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., http://www.fsf.org/about/contact/.
*/
#include <ouroboros/md5.h>
#include <stdlib.h>
#include <stdint.h>
#include <assert.h>
#include <string.h>
#include <stdio.h>
static char * hash_to_str(uint8_t * hash,
size_t len)
{
size_t i;
char * HEX = "0123456789abcdef";
char * str;
str = malloc(len * 2 + 1);
if (str == NULL)
return NULL;
for (i = 0; i < len; ++i) {
str[i * 2] = HEX[(hash[i] & 0xF0) >> 4];
str[i * 2 + 1] = HEX[hash[i] & 0x0F];
}
str[2 * i] = '\0';
return str;
}
static int check_hash(char * check,
uint8_t * hash,
size_t len)
{
char * res;
int ret;
assert(hash);
assert(check);
assert(strlen(check));
res = hash_to_str(hash, len);
if (res == NULL) {
printf("Out of memory.\n");
return -1;
}
ret = strcmp(res, check);
printf("hash : %s\n", res);
printf("check : %s\n\n", check);
free(res);
return ret;
}
int md5_test(int argc,
char ** argv)
{
struct md5_ctx ctx;
/* Storage for result. */
uint8_t res[MD5_HASH_LEN];
/* SHA3 test vectors */
char * str1_inp = "abc";
char * str1_md5 = "900150983cd24fb0d6963f7d28e17f72";
char * str2_inp = "The quick brown fox jumps over the lazy dog";
char * str2_md5 = "9e107d9d372bb6826bd81d3542a419d6";
char * str3_inp =
"abcdbcdecdefdefgefghfghighijhijk"
"ijkljklmklmnlmnomnopnopq";
char * str3_inp2 =
" abcdbcdecdefdefgefghfghighijhijk"
"ijkljklmklmnlmnomnopnopq";
char * str3_md5 = "8215ef0796a20bcaaae116d3876c664a";
(void) argc;
(void) argv;
/* 1st input string. */
printf("test: %s.\n\n", str1_inp);
rhash_md5_init(&ctx);
rhash_md5_update(&ctx, str1_inp, strlen(str1_inp));
rhash_md5_final(&ctx, res);
if (check_hash(str1_md5, res, MD5_HASH_LEN))
return -1;
/* 2nd input string. */
printf("test: <empty string>.\n\n");
rhash_md5_init(&ctx);
rhash_md5_update(&ctx, str2_inp, strlen(str2_inp));
rhash_md5_final(&ctx, res);
if (check_hash(str2_md5, res, MD5_HASH_LEN))
return -1;
/* 3rd input string */
printf("test: %s.\n\n", str3_inp);
rhash_md5_init(&ctx);
rhash_md5_update(&ctx, str3_inp, strlen(str3_inp));
rhash_md5_final(&ctx, res);
if (check_hash(str3_md5, res, MD5_HASH_LEN))
return -1;
/* unaligned 3rd input string. */
printf("test: %s.\n\n", str3_inp2 + 1);
rhash_md5_init(&ctx);
rhash_md5_update(&ctx, str3_inp2 + 1, strlen(str3_inp2 + 1));
rhash_md5_final(&ctx, res);
if (check_hash(str3_md5, res, MD5_HASH_LEN))
return -1;
return 0;
}
|
