OLD | NEW |
1 // Copyright 2014 PDFium Authors. All rights reserved. | 1 // Copyright 2014 PDFium Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 // Original code copyright 2014 Foxit Software Inc. http://www.foxitsoftware.com | 5 // Original code copyright 2014 Foxit Software Inc. http://www.foxitsoftware.com |
6 | 6 |
7 #include "core/fdrm/crypto/include/fx_crypt.h" | 7 #include "core/fdrm/crypto/include/fx_crypt.h" |
8 | 8 |
9 #ifdef __cplusplus | 9 #ifdef __cplusplus |
10 extern "C" { | 10 extern "C" { |
11 #endif | 11 #endif |
12 struct rc4_state { | 12 struct rc4_state { |
13 int x, y, m[256]; | 13 int x, y, m[256]; |
14 }; | 14 }; |
15 void CRYPT_ArcFourSetup(void* context, const uint8_t* key, FX_DWORD length) { | 15 void CRYPT_ArcFourSetup(void* context, const uint8_t* key, uint32_t length) { |
16 rc4_state* s = (rc4_state*)context; | 16 rc4_state* s = (rc4_state*)context; |
17 int i, j, k, *m, a; | 17 int i, j, k, *m, a; |
18 s->x = 0; | 18 s->x = 0; |
19 s->y = 0; | 19 s->y = 0; |
20 m = s->m; | 20 m = s->m; |
21 for (i = 0; i < 256; i++) { | 21 for (i = 0; i < 256; i++) { |
22 m[i] = i; | 22 m[i] = i; |
23 } | 23 } |
24 j = k = 0; | 24 j = k = 0; |
25 for (i = 0; i < 256; i++) { | 25 for (i = 0; i < 256; i++) { |
26 a = m[i]; | 26 a = m[i]; |
27 j = (j + a + key[k]) & 0xFF; | 27 j = (j + a + key[k]) & 0xFF; |
28 m[i] = m[j]; | 28 m[i] = m[j]; |
29 m[j] = a; | 29 m[j] = a; |
30 if (++k >= (int)length) { | 30 if (++k >= (int)length) { |
31 k = 0; | 31 k = 0; |
32 } | 32 } |
33 } | 33 } |
34 } | 34 } |
35 void CRYPT_ArcFourCrypt(void* context, unsigned char* data, FX_DWORD length) { | 35 void CRYPT_ArcFourCrypt(void* context, unsigned char* data, uint32_t length) { |
36 struct rc4_state* s = (struct rc4_state*)context; | 36 struct rc4_state* s = (struct rc4_state*)context; |
37 int i, x, y, *m, a, b; | 37 int i, x, y, *m, a, b; |
38 x = s->x; | 38 x = s->x; |
39 y = s->y; | 39 y = s->y; |
40 m = s->m; | 40 m = s->m; |
41 for (i = 0; i < (int)length; i++) { | 41 for (i = 0; i < (int)length; i++) { |
42 x = (x + 1) & 0xFF; | 42 x = (x + 1) & 0xFF; |
43 a = m[x]; | 43 a = m[x]; |
44 y = (y + a) & 0xFF; | 44 y = (y + a) & 0xFF; |
45 m[x] = b = m[y]; | 45 m[x] = b = m[y]; |
46 m[y] = a; | 46 m[y] = a; |
47 data[i] ^= m[(a + b) & 0xFF]; | 47 data[i] ^= m[(a + b) & 0xFF]; |
48 } | 48 } |
49 s->x = x; | 49 s->x = x; |
50 s->y = y; | 50 s->y = y; |
51 } | 51 } |
52 void CRYPT_ArcFourCryptBlock(uint8_t* pData, | 52 void CRYPT_ArcFourCryptBlock(uint8_t* pData, |
53 FX_DWORD size, | 53 uint32_t size, |
54 const uint8_t* key, | 54 const uint8_t* key, |
55 FX_DWORD keylen) { | 55 uint32_t keylen) { |
56 rc4_state s; | 56 rc4_state s; |
57 CRYPT_ArcFourSetup(&s, key, keylen); | 57 CRYPT_ArcFourSetup(&s, key, keylen); |
58 CRYPT_ArcFourCrypt(&s, pData, size); | 58 CRYPT_ArcFourCrypt(&s, pData, size); |
59 } | 59 } |
60 struct md5_context { | 60 struct md5_context { |
61 FX_DWORD total[2]; | 61 uint32_t total[2]; |
62 FX_DWORD state[4]; | 62 uint32_t state[4]; |
63 uint8_t buffer[64]; | 63 uint8_t buffer[64]; |
64 }; | 64 }; |
65 #define GET_FX_DWORD(n, b, i) \ | 65 #define GET_FX_DWORD(n, b, i) \ |
66 { \ | 66 { \ |
67 (n) = (FX_DWORD)((uint8_t*)b)[(i)] | \ | 67 (n) = (uint32_t)((uint8_t*)b)[(i)] | \ |
68 (((FX_DWORD)((uint8_t*)b)[(i) + 1]) << 8) | \ | 68 (((uint32_t)((uint8_t*)b)[(i) + 1]) << 8) | \ |
69 (((FX_DWORD)((uint8_t*)b)[(i) + 2]) << 16) | \ | 69 (((uint32_t)((uint8_t*)b)[(i) + 2]) << 16) | \ |
70 (((FX_DWORD)((uint8_t*)b)[(i) + 3]) << 24); \ | 70 (((uint32_t)((uint8_t*)b)[(i) + 3]) << 24); \ |
71 } | 71 } |
72 #define PUT_FX_DWORD(n, b, i) \ | 72 #define PUT_FX_DWORD(n, b, i) \ |
73 { \ | 73 { \ |
74 (((uint8_t*)b)[(i)]) = (uint8_t)(((n)) & 0xFF); \ | 74 (((uint8_t*)b)[(i)]) = (uint8_t)(((n)) & 0xFF); \ |
75 (((uint8_t*)b)[(i) + 1]) = (uint8_t)(((n) >> 8) & 0xFF); \ | 75 (((uint8_t*)b)[(i) + 1]) = (uint8_t)(((n) >> 8) & 0xFF); \ |
76 (((uint8_t*)b)[(i) + 2]) = (uint8_t)(((n) >> 16) & 0xFF); \ | 76 (((uint8_t*)b)[(i) + 2]) = (uint8_t)(((n) >> 16) & 0xFF); \ |
77 (((uint8_t*)b)[(i) + 3]) = (uint8_t)(((n) >> 24) & 0xFF); \ | 77 (((uint8_t*)b)[(i) + 3]) = (uint8_t)(((n) >> 24) & 0xFF); \ |
78 } | 78 } |
79 void md5_process(struct md5_context* ctx, const uint8_t data[64]) { | 79 void md5_process(struct md5_context* ctx, const uint8_t data[64]) { |
80 FX_DWORD A, B, C, D, X[16]; | 80 uint32_t A, B, C, D, X[16]; |
81 GET_FX_DWORD(X[0], data, 0); | 81 GET_FX_DWORD(X[0], data, 0); |
82 GET_FX_DWORD(X[1], data, 4); | 82 GET_FX_DWORD(X[1], data, 4); |
83 GET_FX_DWORD(X[2], data, 8); | 83 GET_FX_DWORD(X[2], data, 8); |
84 GET_FX_DWORD(X[3], data, 12); | 84 GET_FX_DWORD(X[3], data, 12); |
85 GET_FX_DWORD(X[4], data, 16); | 85 GET_FX_DWORD(X[4], data, 16); |
86 GET_FX_DWORD(X[5], data, 20); | 86 GET_FX_DWORD(X[5], data, 20); |
87 GET_FX_DWORD(X[6], data, 24); | 87 GET_FX_DWORD(X[6], data, 24); |
88 GET_FX_DWORD(X[7], data, 28); | 88 GET_FX_DWORD(X[7], data, 28); |
89 GET_FX_DWORD(X[8], data, 32); | 89 GET_FX_DWORD(X[8], data, 32); |
90 GET_FX_DWORD(X[9], data, 36); | 90 GET_FX_DWORD(X[9], data, 36); |
(...skipping 92 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
183 } | 183 } |
184 void CRYPT_MD5Start(void* context) { | 184 void CRYPT_MD5Start(void* context) { |
185 struct md5_context* ctx = (struct md5_context*)context; | 185 struct md5_context* ctx = (struct md5_context*)context; |
186 ctx->total[0] = 0; | 186 ctx->total[0] = 0; |
187 ctx->total[1] = 0; | 187 ctx->total[1] = 0; |
188 ctx->state[0] = 0x67452301; | 188 ctx->state[0] = 0x67452301; |
189 ctx->state[1] = 0xEFCDAB89; | 189 ctx->state[1] = 0xEFCDAB89; |
190 ctx->state[2] = 0x98BADCFE; | 190 ctx->state[2] = 0x98BADCFE; |
191 ctx->state[3] = 0x10325476; | 191 ctx->state[3] = 0x10325476; |
192 } | 192 } |
193 void CRYPT_MD5Update(void* pctx, const uint8_t* input, FX_DWORD length) { | 193 void CRYPT_MD5Update(void* pctx, const uint8_t* input, uint32_t length) { |
194 struct md5_context* ctx = (struct md5_context*)pctx; | 194 struct md5_context* ctx = (struct md5_context*)pctx; |
195 FX_DWORD left, fill; | 195 uint32_t left, fill; |
196 if (!length) { | 196 if (!length) { |
197 return; | 197 return; |
198 } | 198 } |
199 left = (ctx->total[0] >> 3) & 0x3F; | 199 left = (ctx->total[0] >> 3) & 0x3F; |
200 fill = 64 - left; | 200 fill = 64 - left; |
201 ctx->total[0] += length << 3; | 201 ctx->total[0] += length << 3; |
202 ctx->total[1] += length >> 29; | 202 ctx->total[1] += length >> 29; |
203 ctx->total[0] &= 0xFFFFFFFF; | 203 ctx->total[0] &= 0xFFFFFFFF; |
204 ctx->total[1] += ctx->total[0] < length << 3; | 204 ctx->total[1] += ctx->total[0] < length << 3; |
205 if (left && length >= fill) { | 205 if (left && length >= fill) { |
(...skipping 11 matching lines...) Expand all Loading... |
217 if (length) { | 217 if (length) { |
218 FXSYS_memcpy((void*)(ctx->buffer + left), (void*)input, length); | 218 FXSYS_memcpy((void*)(ctx->buffer + left), (void*)input, length); |
219 } | 219 } |
220 } | 220 } |
221 const uint8_t md5_padding[64] = { | 221 const uint8_t md5_padding[64] = { |
222 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, | 222 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
223 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, | 223 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
224 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; | 224 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; |
225 void CRYPT_MD5Finish(void* pctx, uint8_t digest[16]) { | 225 void CRYPT_MD5Finish(void* pctx, uint8_t digest[16]) { |
226 struct md5_context* ctx = (struct md5_context*)pctx; | 226 struct md5_context* ctx = (struct md5_context*)pctx; |
227 FX_DWORD last, padn; | 227 uint32_t last, padn; |
228 uint8_t msglen[8]; | 228 uint8_t msglen[8]; |
229 PUT_FX_DWORD(ctx->total[0], msglen, 0); | 229 PUT_FX_DWORD(ctx->total[0], msglen, 0); |
230 PUT_FX_DWORD(ctx->total[1], msglen, 4); | 230 PUT_FX_DWORD(ctx->total[1], msglen, 4); |
231 last = (ctx->total[0] >> 3) & 0x3F; | 231 last = (ctx->total[0] >> 3) & 0x3F; |
232 padn = (last < 56) ? (56 - last) : (120 - last); | 232 padn = (last < 56) ? (56 - last) : (120 - last); |
233 CRYPT_MD5Update(ctx, md5_padding, padn); | 233 CRYPT_MD5Update(ctx, md5_padding, padn); |
234 CRYPT_MD5Update(ctx, msglen, 8); | 234 CRYPT_MD5Update(ctx, msglen, 8); |
235 PUT_FX_DWORD(ctx->state[0], digest, 0); | 235 PUT_FX_DWORD(ctx->state[0], digest, 0); |
236 PUT_FX_DWORD(ctx->state[1], digest, 4); | 236 PUT_FX_DWORD(ctx->state[1], digest, 4); |
237 PUT_FX_DWORD(ctx->state[2], digest, 8); | 237 PUT_FX_DWORD(ctx->state[2], digest, 8); |
238 PUT_FX_DWORD(ctx->state[3], digest, 12); | 238 PUT_FX_DWORD(ctx->state[3], digest, 12); |
239 } | 239 } |
240 void CRYPT_MD5Generate(const uint8_t* input, | 240 void CRYPT_MD5Generate(const uint8_t* input, |
241 FX_DWORD length, | 241 uint32_t length, |
242 uint8_t digest[16]) { | 242 uint8_t digest[16]) { |
243 md5_context ctx; | 243 md5_context ctx; |
244 CRYPT_MD5Start(&ctx); | 244 CRYPT_MD5Start(&ctx); |
245 CRYPT_MD5Update(&ctx, input, length); | 245 CRYPT_MD5Update(&ctx, input, length); |
246 CRYPT_MD5Finish(&ctx, digest); | 246 CRYPT_MD5Finish(&ctx, digest); |
247 } | 247 } |
248 static FX_BOOL (*g_PubKeyDecryptor)(const uint8_t* pData, | 248 static FX_BOOL (*g_PubKeyDecryptor)(const uint8_t* pData, |
249 FX_DWORD size, | 249 uint32_t size, |
250 uint8_t* data_buf, | 250 uint8_t* data_buf, |
251 FX_DWORD& data_len) = NULL; | 251 uint32_t& data_len) = NULL; |
252 void CRYPT_SetPubKeyDecryptor(FX_BOOL (*func)(const uint8_t* pData, | 252 void CRYPT_SetPubKeyDecryptor(FX_BOOL (*func)(const uint8_t* pData, |
253 FX_DWORD size, | 253 uint32_t size, |
254 uint8_t* data_buf, | 254 uint8_t* data_buf, |
255 FX_DWORD& data_len)) { | 255 uint32_t& data_len)) { |
256 g_PubKeyDecryptor = func; | 256 g_PubKeyDecryptor = func; |
257 } | 257 } |
258 #ifdef __cplusplus | 258 #ifdef __cplusplus |
259 }; | 259 }; |
260 #endif | 260 #endif |
OLD | NEW |