1 /*
2 * Universal wrapper API for a message digest function
3 *
4 * Markus Kuhn <http://www.cl.cam.ac.uk/~mgk25/>
5 */
6
7 #include <stdlib.h>
8 #include <string.h>
9 #include <limits.h>
10 #include <assert.h>
11 #include "md.h"
12 #include "rmd160.h"
13
md_init(md_state * md)14 void md_init(md_state * md)
15 {
16 /* check assumptions made in rmd160.h (should produce no code) */
17 assert(sizeof(dword) == 4);
18 assert(sizeof(word) == 2);
19 assert(sizeof(byte) == 1);
20
21 md->length_lo = md->length_hi = 0;
22 rmd160_init((dword *) md->md);
23 }
24
25
md_add(md_state * md,const void * src,size_t len)26 void md_add(md_state *md, const void *src, size_t len)
27 {
28 int i;
29 int remaining = md->length_lo & (MD_BUFLEN-1);
30 unsigned chunk;
31 unsigned long old_lo = md->length_lo;
32 dword X[16];
33
34 /* update 64-bit counter of bytes added so far */
35 md->length_lo += len & 0xffffffff;
36 if (md->length_lo < old_lo)
37 md->length_hi++;
38 #if SIZE_MAX > 4294967295U
39 md->length_hi += len >> 32;
40 if (md->length_lo > 4294967295U) {
41 md->length_hi += md->length_lo >> 32;
42 md->length_lo &= 0xffffffff;
43 }
44 #endif
45 /* complete remaining input block of compression function */
46 if (remaining > 0) {
47 chunk = MD_BUFLEN - remaining;
48 if (chunk > len)
49 chunk = len;
50 memcpy(md->buf + remaining, src, chunk);
51 len -= chunk;
52 src += chunk;
53 if (remaining + chunk == MD_BUFLEN) {
54 for (i = 0; i < 64; i += 4)
55 X[i>>2] = BYTES_TO_DWORD(md->buf + i);
56 rmd160_compress((dword *) md->md, X);
57 }
58 }
59 /* feed whole input blocks to compression function */
60 while (len >= MD_BUFLEN) {
61 for (i = 0; i < 64; i += 4)
62 X[i>>2] = BYTES_TO_DWORD((unsigned char *)src + i);
63 rmd160_compress((dword *) md->md, X);
64 src += MD_BUFLEN;
65 len -= MD_BUFLEN;
66 }
67 /* partially fill buffer with remaining bytes */
68 if (len > 0)
69 memcpy(md->buf, src, len);
70 }
71
72
md_close(md_state * md,unsigned char * result)73 void md_close(md_state *md, unsigned char *result)
74 {
75 int i;
76
77 rmd160_finish((dword *) md->md, (byte *) md->buf,
78 (dword) md->length_lo, (dword) md->length_hi);
79
80 for (i = 0; i < MD_LEN; i++)
81 result[i] = ((dword *) md->md)[i>>2] >> (8 * (i & 3));
82 }
83
84
md_selftest(void)85 int md_selftest(void)
86 {
87 int i, j, fail = 0;
88 md_state md;
89 unsigned char result[MD_LEN];
90
91 char *pattern[8] = {
92 "",
93 "a",
94 "abc",
95 "message digest",
96 "abcdefghijklmnopqrstuvwxyz",
97 "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq",
98 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789",
99 "123456789012345678901234567890123456789012345678901234567890"
100 "12345678901234567890"
101 };
102
103 #ifdef MD_RIPEMD128
104 unsigned char md_result[9][MD_LEN] = {
105 { 0xcd, 0xf2, 0x62, 0x13, 0xa1, 0x50, 0xdc, 0x3e,
106 0xcb, 0x61, 0x0f, 0x18, 0xf6, 0xb3, 0x8b, 0x46 },
107 { 0x86, 0xbe, 0x7a, 0xfa, 0x33, 0x9d, 0x0f, 0xc7,
108 0xcf, 0xc7, 0x85, 0xe7, 0x2f, 0x57, 0x8d, 0x33 },
109 { 0xc1, 0x4a, 0x12, 0x19, 0x9c, 0x66, 0xe4, 0xba,
110 0x84, 0x63, 0x6b, 0x0f, 0x69, 0x14, 0x4c, 0x77 },
111 { 0x9e, 0x32, 0x7b, 0x3d, 0x6e, 0x52, 0x30, 0x62,
112 0xaf, 0xc1, 0x13, 0x2d, 0x7d, 0xf9, 0xd1, 0xb8 },
113 { 0xfd, 0x2a, 0xa6, 0x07, 0xf7, 0x1d, 0xc8, 0xf5,
114 0x10, 0x71, 0x49, 0x22, 0xb3, 0x71, 0x83, 0x4e },
115 { 0xa1, 0xaa, 0x06, 0x89, 0xd0, 0xfa, 0xfa, 0x2d,
116 0xdc, 0x22, 0xe8, 0x8b, 0x49, 0x13, 0x3a, 0x06 },
117 { 0xd1, 0xe9, 0x59, 0xeb, 0x17, 0x9c, 0x91, 0x1f,
118 0xae, 0xa4, 0x62, 0x4c, 0x60, 0xc5, 0xc7, 0x02 },
119 { 0x3f, 0x45, 0xef, 0x19, 0x47, 0x32, 0xc2, 0xdb,
120 0xb2, 0xc4, 0xa2, 0xc7, 0x69, 0x79, 0x5f, 0xa3 },
121 { 0x4a, 0x7f, 0x57, 0x23, 0xf9, 0x54, 0xeb, 0xa1,
122 0x21, 0x6c, 0x9d, 0x8f, 0x63, 0x20, 0x43, 0x1f }
123 };
124 #endif
125 #ifdef MD_RIPEMD160
126 unsigned char md_result[9][MD_LEN] = {
127 { 0x9c, 0x11, 0x85, 0xa5, 0xc5, 0xe9, 0xfc, 0x54, 0x61, 0x28,
128 0x08, 0x97, 0x7e, 0xe8, 0xf5, 0x48, 0xb2, 0x25, 0x8d, 0x31 },
129 { 0x0b, 0xdc, 0x9d, 0x2d, 0x25, 0x6b, 0x3e, 0xe9, 0xda, 0xae,
130 0x34, 0x7b, 0xe6, 0xf4, 0xdc, 0x83, 0x5a, 0x46, 0x7f, 0xfe },
131 { 0x8e, 0xb2, 0x08, 0xf7, 0xe0, 0x5d, 0x98, 0x7a, 0x9b, 0x04,
132 0x4a, 0x8e, 0x98, 0xc6, 0xb0, 0x87, 0xf1, 0x5a, 0x0b, 0xfc },
133 { 0x5d, 0x06, 0x89, 0xef, 0x49, 0xd2, 0xfa, 0xe5, 0x72, 0xb8,
134 0x81, 0xb1, 0x23, 0xa8, 0x5f, 0xfa, 0x21, 0x59, 0x5f, 0x36 },
135 { 0xf7, 0x1c, 0x27, 0x10, 0x9c, 0x69, 0x2c, 0x1b, 0x56, 0xbb,
136 0xdc, 0xeb, 0x5b, 0x9d, 0x28, 0x65, 0xb3, 0x70, 0x8d, 0xbc },
137 { 0x12, 0xa0, 0x53, 0x38, 0x4a, 0x9c, 0x0c, 0x88, 0xe4, 0x05,
138 0xa0, 0x6c, 0x27, 0xdc, 0xf4, 0x9a, 0xda, 0x62, 0xeb, 0x2b },
139 { 0xb0, 0xe2, 0x0b, 0x6e, 0x31, 0x16, 0x64, 0x02, 0x86, 0xed,
140 0x3a, 0x87, 0xa5, 0x71, 0x30, 0x79, 0xb2, 0x1f, 0x51, 0x89 },
141 { 0x9b, 0x75, 0x2e, 0x45, 0x57, 0x3d, 0x4b, 0x39, 0xf4, 0xdb,
142 0xd3, 0x32, 0x3c, 0xab, 0x82, 0xbf, 0x63, 0x32, 0x6b, 0xfb },
143 { 0x52, 0x78, 0x32, 0x43, 0xc1, 0x69, 0x7b, 0xdb, 0xe1, 0x6d,
144 0x37, 0xf9, 0x7f, 0x68, 0xf0, 0x83, 0x25, 0xdc, 0x15, 0x28 }
145 };
146 #endif
147
148 for (i = 0; i <= 16; i++) {
149 md_init(&md);
150 if (i == 16)
151 /* test 16: one million 'a' */
152 for (j = 0; j < 1000000; j += 125)
153 md_add(&md, "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
154 "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
155 "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", 125);
156 else if (i & 1)
157 /* single byte feed */
158 for (j = 0; pattern[i/2][j]; j++)
159 md_add(&md, pattern[i/2]+j, 1);
160 else
161 /* single chunk feed */
162 md_add(&md, pattern[i/2], strlen(pattern[i/2]));
163 md_close(&md, result);
164 if (memcmp(result, md_result[i/2], MD_LEN) != 0) {
165 abort();
166 fail++;
167 }
168 }
169
170 return fail;
171 }
172