/src/mupdf/source/fitz/crypt-md5.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* |
2 | | * This is an implementation of the RSA Data Security, Inc. * MD5 |
3 | | * Message-Digest Algorithm (RFC 1321). |
4 | | * |
5 | | * Homepage: |
6 | | * http://openwall.info/wiki/people/solar/software/public-domain-source-code/md5 |
7 | | * |
8 | | * Author: |
9 | | * Alexander Peslyak, better known as Solar Designer <solar at openwall.com> |
10 | | * |
11 | | * This software was written by Alexander Peslyak in 2001. No copyright is |
12 | | * claimed, and the software is hereby placed in the public domain. |
13 | | * In case this attempt to disclaim copyright and place the software in the |
14 | | * public domain is deemed null and void, then the software is |
15 | | * Copyright (c) 2001 Alexander Peslyak and it is hereby released to the |
16 | | * general public under the following terms: |
17 | | * |
18 | | * Redistribution and use in source and binary forms, with or without |
19 | | * modification, are permitted. |
20 | | * |
21 | | * There's ABSOLUTELY NO WARRANTY, express or implied. |
22 | | * |
23 | | * (This is a heavily cut-down "BSD license".) |
24 | | * |
25 | | * This differs from Colin Plumb's older public domain implementation in that |
26 | | * no exactly 32-bit integer data type is required (any 32-bit or wider |
27 | | * unsigned integer data type will do), there's no compile-time endianness |
28 | | * configuration, and the function prototypes match OpenSSL's. No code from |
29 | | * Colin Plumb's implementation has been reused; this comment merely compares |
30 | | * the properties of the two independent implementations. |
31 | | * |
32 | | * The primary goals of this implementation are portability and ease of use. |
33 | | * It is meant to be fast, but not as fast as possible. Some known |
34 | | * optimizations are not included to reduce source code size and avoid |
35 | | * compile-time configuration. |
36 | | */ |
37 | | |
38 | | #include "mupdf/fitz.h" |
39 | | |
40 | | #include <string.h> |
41 | | |
42 | | /* |
43 | | * The basic MD5 functions. |
44 | | * |
45 | | * F and G are optimized compared to their RFC 1321 definitions for |
46 | | * architectures that lack an AND-NOT instruction, just like in Colin Plumb's |
47 | | * implementation. |
48 | | */ |
49 | 6.58G | #define F(x, y, z) ((z) ^ ((x) & ((y) ^ (z)))) |
50 | 6.58G | #define G(x, y, z) ((y) ^ ((z) & ((x) ^ (y)))) |
51 | 3.29G | #define H(x, y, z) (((x) ^ (y)) ^ (z)) |
52 | 3.29G | #define H2(x, y, z) ((x) ^ ((y) ^ (z))) |
53 | 6.58G | #define I(x, y, z) ((y) ^ ((x) | ~(z))) |
54 | | |
55 | | /* |
56 | | * The MD5 transformation for all four rounds. |
57 | | */ |
58 | | #define STEP(f, a, b, c, d, x, t, s) \ |
59 | 26.3G | (a) += f((b), (c), (d)) + (x) + (t); \ |
60 | 26.3G | (a) = (((a) << (s)) | (((a) & 0xffffffff) >> (32 - (s)))); \ |
61 | 26.3G | (a) += (b) |
62 | | |
63 | | /* |
64 | | * SET reads 4 input bytes in little-endian byte order and stores them in a |
65 | | * properly aligned word in host byte order. |
66 | | */ |
67 | | #define SET(n) \ |
68 | | (block[(n)] = \ |
69 | | (uint32_t)ptr[(n) * 4] | \ |
70 | | ((uint32_t)ptr[(n) * 4 + 1] << 8) | \ |
71 | | ((uint32_t)ptr[(n) * 4 + 2] << 16) | \ |
72 | | ((uint32_t)ptr[(n) * 4 + 3] << 24)) |
73 | | #define GET(n) \ |
74 | | (block[(n)]) |
75 | | |
76 | | /* |
77 | | * This processes one or more 64-byte data blocks, but does NOT update the bit |
78 | | * counters. There are no alignment requirements. |
79 | | */ |
80 | | static const unsigned char *body(fz_md5 *ctx, const unsigned char *ptr, uint32_t size) |
81 | 175k | { |
82 | 175k | uint32_t a, b, c, d; |
83 | 175k | uint32_t saved_a, saved_b, saved_c, saved_d; |
84 | 175k | uint32_t block[16]; |
85 | | |
86 | 175k | a = ctx->a; |
87 | 175k | b = ctx->b; |
88 | 175k | c = ctx->c; |
89 | 175k | d = ctx->d; |
90 | | |
91 | 411M | do { |
92 | 411M | saved_a = a; |
93 | 411M | saved_b = b; |
94 | 411M | saved_c = c; |
95 | 411M | saved_d = d; |
96 | | |
97 | | /* Round 1 */ |
98 | 411M | STEP(F, a, b, c, d, SET(0), 0xd76aa478, 7); |
99 | 411M | STEP(F, d, a, b, c, SET(1), 0xe8c7b756, 12); |
100 | 411M | STEP(F, c, d, a, b, SET(2), 0x242070db, 17); |
101 | 411M | STEP(F, b, c, d, a, SET(3), 0xc1bdceee, 22); |
102 | 411M | STEP(F, a, b, c, d, SET(4), 0xf57c0faf, 7); |
103 | 411M | STEP(F, d, a, b, c, SET(5), 0x4787c62a, 12); |
104 | 411M | STEP(F, c, d, a, b, SET(6), 0xa8304613, 17); |
105 | 411M | STEP(F, b, c, d, a, SET(7), 0xfd469501, 22); |
106 | 411M | STEP(F, a, b, c, d, SET(8), 0x698098d8, 7); |
107 | 411M | STEP(F, d, a, b, c, SET(9), 0x8b44f7af, 12); |
108 | 411M | STEP(F, c, d, a, b, SET(10), 0xffff5bb1, 17); |
109 | 411M | STEP(F, b, c, d, a, SET(11), 0x895cd7be, 22); |
110 | 411M | STEP(F, a, b, c, d, SET(12), 0x6b901122, 7); |
111 | 411M | STEP(F, d, a, b, c, SET(13), 0xfd987193, 12); |
112 | 411M | STEP(F, c, d, a, b, SET(14), 0xa679438e, 17); |
113 | 411M | STEP(F, b, c, d, a, SET(15), 0x49b40821, 22); |
114 | | |
115 | | /* Round 2 */ |
116 | 411M | STEP(G, a, b, c, d, GET(1), 0xf61e2562, 5); |
117 | 411M | STEP(G, d, a, b, c, GET(6), 0xc040b340, 9); |
118 | 411M | STEP(G, c, d, a, b, GET(11), 0x265e5a51, 14); |
119 | 411M | STEP(G, b, c, d, a, GET(0), 0xe9b6c7aa, 20); |
120 | 411M | STEP(G, a, b, c, d, GET(5), 0xd62f105d, 5); |
121 | 411M | STEP(G, d, a, b, c, GET(10), 0x02441453, 9); |
122 | 411M | STEP(G, c, d, a, b, GET(15), 0xd8a1e681, 14); |
123 | 411M | STEP(G, b, c, d, a, GET(4), 0xe7d3fbc8, 20); |
124 | 411M | STEP(G, a, b, c, d, GET(9), 0x21e1cde6, 5); |
125 | 411M | STEP(G, d, a, b, c, GET(14), 0xc33707d6, 9); |
126 | 411M | STEP(G, c, d, a, b, GET(3), 0xf4d50d87, 14); |
127 | 411M | STEP(G, b, c, d, a, GET(8), 0x455a14ed, 20); |
128 | 411M | STEP(G, a, b, c, d, GET(13), 0xa9e3e905, 5); |
129 | 411M | STEP(G, d, a, b, c, GET(2), 0xfcefa3f8, 9); |
130 | 411M | STEP(G, c, d, a, b, GET(7), 0x676f02d9, 14); |
131 | 411M | STEP(G, b, c, d, a, GET(12), 0x8d2a4c8a, 20); |
132 | | |
133 | | /* Round 3 */ |
134 | 411M | STEP(H, a, b, c, d, GET(5), 0xfffa3942, 4); |
135 | 411M | STEP(H2, d, a, b, c, GET(8), 0x8771f681, 11); |
136 | 411M | STEP(H, c, d, a, b, GET(11), 0x6d9d6122, 16); |
137 | 411M | STEP(H2, b, c, d, a, GET(14), 0xfde5380c, 23); |
138 | 411M | STEP(H, a, b, c, d, GET(1), 0xa4beea44, 4); |
139 | 411M | STEP(H2, d, a, b, c, GET(4), 0x4bdecfa9, 11); |
140 | 411M | STEP(H, c, d, a, b, GET(7), 0xf6bb4b60, 16); |
141 | 411M | STEP(H2, b, c, d, a, GET(10), 0xbebfbc70, 23); |
142 | 411M | STEP(H, a, b, c, d, GET(13), 0x289b7ec6, 4); |
143 | 411M | STEP(H2, d, a, b, c, GET(0), 0xeaa127fa, 11); |
144 | 411M | STEP(H, c, d, a, b, GET(3), 0xd4ef3085, 16); |
145 | 411M | STEP(H2, b, c, d, a, GET(6), 0x04881d05, 23); |
146 | 411M | STEP(H, a, b, c, d, GET(9), 0xd9d4d039, 4); |
147 | 411M | STEP(H2, d, a, b, c, GET(12), 0xe6db99e5, 11); |
148 | 411M | STEP(H, c, d, a, b, GET(15), 0x1fa27cf8, 16); |
149 | 411M | STEP(H2, b, c, d, a, GET(2), 0xc4ac5665, 23); |
150 | | |
151 | | /* Round 4 */ |
152 | 411M | STEP(I, a, b, c, d, GET(0), 0xf4292244, 6); |
153 | 411M | STEP(I, d, a, b, c, GET(7), 0x432aff97, 10); |
154 | 411M | STEP(I, c, d, a, b, GET(14), 0xab9423a7, 15); |
155 | 411M | STEP(I, b, c, d, a, GET(5), 0xfc93a039, 21); |
156 | 411M | STEP(I, a, b, c, d, GET(12), 0x655b59c3, 6); |
157 | 411M | STEP(I, d, a, b, c, GET(3), 0x8f0ccc92, 10); |
158 | 411M | STEP(I, c, d, a, b, GET(10), 0xffeff47d, 15); |
159 | 411M | STEP(I, b, c, d, a, GET(1), 0x85845dd1, 21); |
160 | 411M | STEP(I, a, b, c, d, GET(8), 0x6fa87e4f, 6); |
161 | 411M | STEP(I, d, a, b, c, GET(15), 0xfe2ce6e0, 10); |
162 | 411M | STEP(I, c, d, a, b, GET(6), 0xa3014314, 15); |
163 | 411M | STEP(I, b, c, d, a, GET(13), 0x4e0811a1, 21); |
164 | 411M | STEP(I, a, b, c, d, GET(4), 0xf7537e82, 6); |
165 | 411M | STEP(I, d, a, b, c, GET(11), 0xbd3af235, 10); |
166 | 411M | STEP(I, c, d, a, b, GET(2), 0x2ad7d2bb, 15); |
167 | 411M | STEP(I, b, c, d, a, GET(9), 0xeb86d391, 21); |
168 | | |
169 | 411M | a += saved_a; |
170 | 411M | b += saved_b; |
171 | 411M | c += saved_c; |
172 | 411M | d += saved_d; |
173 | | |
174 | 411M | ptr += 64; |
175 | 411M | } while (size -= 64); |
176 | | |
177 | 175k | ctx->a = a; |
178 | 175k | ctx->b = b; |
179 | 175k | ctx->c = c; |
180 | 175k | ctx->d = d; |
181 | | |
182 | 175k | return ptr; |
183 | 175k | } |
184 | | |
185 | | void fz_md5_init(fz_md5 *ctx) |
186 | 100k | { |
187 | 100k | ctx->a = 0x67452301; |
188 | 100k | ctx->b = 0xefcdab89; |
189 | 100k | ctx->c = 0x98badcfe; |
190 | 100k | ctx->d = 0x10325476; |
191 | | |
192 | 100k | ctx->lo = 0; |
193 | 100k | ctx->hi = 0; |
194 | 100k | } |
195 | | |
196 | | void fz_md5_update(fz_md5 *ctx, const unsigned char *data, size_t size) |
197 | 115k | { |
198 | 115k | uint32_t saved_lo; |
199 | 115k | uint32_t used, available; |
200 | | |
201 | 115k | saved_lo = ctx->lo; |
202 | 115k | if ((ctx->lo = (saved_lo + size) & 0x1fffffff) < saved_lo) |
203 | 0 | ctx->hi++; |
204 | 115k | ctx->hi += (uint32_t)(size >> 29); |
205 | | |
206 | 115k | used = saved_lo & 0x3f; |
207 | | |
208 | 115k | if (used) { |
209 | 14.4k | available = 64 - used; |
210 | | |
211 | 14.4k | if (size < available) { |
212 | 14.1k | memcpy(&ctx->buffer[used], data, size); |
213 | 14.1k | return; |
214 | 14.1k | } |
215 | | |
216 | 297 | memcpy(&ctx->buffer[used], data, available); |
217 | 297 | data = data + available; |
218 | 297 | size -= available; |
219 | 297 | body(ctx, ctx->buffer, 64); |
220 | 297 | } |
221 | | |
222 | 100k | if (size >= 64) { |
223 | 73.8k | data = body(ctx, data, size & ~(uint32_t)0x3f); |
224 | 73.8k | size &= 0x3f; |
225 | 73.8k | } |
226 | | |
227 | 100k | memcpy(ctx->buffer, data, size); |
228 | 100k | } |
229 | | |
230 | | #define OUT(dst, src) \ |
231 | 601k | (dst)[0] = (src); \ |
232 | 601k | (dst)[1] = (src >> 8); \ |
233 | 601k | (dst)[2] = (src >> 16); \ |
234 | 601k | (dst)[3] = (src >> 24) |
235 | | |
236 | | void fz_md5_final(fz_md5 *ctx, unsigned char result[16]) |
237 | 100k | { |
238 | 100k | uint32_t used, available; |
239 | | |
240 | 100k | used = ctx->lo & 0x3f; |
241 | | |
242 | 100k | ctx->buffer[used++] = 0x80; |
243 | | |
244 | 100k | available = 64 - used; |
245 | | |
246 | 100k | if (available < 8) { |
247 | 585 | memset(&ctx->buffer[used], 0, available); |
248 | 585 | body(ctx, ctx->buffer, 64); |
249 | 585 | used = 0; |
250 | 585 | available = 64; |
251 | 585 | } |
252 | | |
253 | 100k | memset(&ctx->buffer[used], 0, available - 8); |
254 | | |
255 | 100k | ctx->lo <<= 3; |
256 | 100k | OUT(&ctx->buffer[56], ctx->lo); |
257 | 100k | OUT(&ctx->buffer[60], ctx->hi); |
258 | | |
259 | 100k | body(ctx, ctx->buffer, 64); |
260 | | |
261 | 100k | OUT(&result[0], ctx->a); |
262 | 100k | OUT(&result[4], ctx->b); |
263 | 100k | OUT(&result[8], ctx->c); |
264 | 100k | OUT(&result[12], ctx->d); |
265 | | |
266 | 100k | memset(ctx, 0, sizeof(*ctx)); |
267 | 100k | } |
268 | | |
269 | | void fz_md5_update_int64(fz_md5 *context, int64_t i) |
270 | 0 | { |
271 | 0 | unsigned char c[8]; |
272 | |
|
273 | 0 | c[0] = (unsigned char)(i); |
274 | 0 | c[1] = (unsigned char)(i>>8); |
275 | 0 | c[2] = (unsigned char)(i>>16); |
276 | 0 | c[3] = (unsigned char)(i>>24); |
277 | 0 | c[4] = (unsigned char)(i>>32); |
278 | 0 | c[5] = (unsigned char)(i>>40); |
279 | 0 | c[6] = (unsigned char)(i>>48); |
280 | 0 | c[7] = (unsigned char)(i>>56); |
281 | |
|
282 | 0 | fz_md5_update(context, &c[0], sizeof(c)); |
283 | 0 | } |