/src/wolfssl-openssl-api/wolfcrypt/src/md2.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* md2.c |
2 | | * |
3 | | * Copyright (C) 2006-2022 wolfSSL Inc. |
4 | | * |
5 | | * This file is part of wolfSSL. |
6 | | * |
7 | | * wolfSSL is free software; you can redistribute it and/or modify |
8 | | * it under the terms of the GNU General Public License as published by |
9 | | * the Free Software Foundation; either version 2 of the License, or |
10 | | * (at your option) any later version. |
11 | | * |
12 | | * wolfSSL is distributed in the hope that it will be useful, |
13 | | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | | * GNU General Public License for more details. |
16 | | * |
17 | | * You should have received a copy of the GNU General Public License |
18 | | * along with this program; if not, write to the Free Software |
19 | | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1335, USA |
20 | | */ |
21 | | |
22 | | |
23 | | |
24 | | #ifdef HAVE_CONFIG_H |
25 | | #include <config.h> |
26 | | #endif |
27 | | |
28 | | #include <wolfssl/wolfcrypt/settings.h> |
29 | | |
30 | | #ifdef WOLFSSL_MD2 |
31 | | |
32 | | #include <wolfssl/wolfcrypt/md2.h> |
33 | | #include <wolfssl/wolfcrypt/error-crypt.h> |
34 | | |
35 | | #ifdef NO_INLINE |
36 | | #include <wolfssl/wolfcrypt/misc.h> |
37 | | #else |
38 | | #define WOLFSSL_MISC_INCLUDED |
39 | | #include <wolfcrypt/src/misc.c> |
40 | | #endif |
41 | | |
42 | | |
43 | | void wc_InitMd2(Md2* md2) |
44 | 0 | { |
45 | 0 | XMEMSET(md2->X, 0, MD2_X_SIZE); |
46 | 0 | XMEMSET(md2->C, 0, MD2_BLOCK_SIZE); |
47 | 0 | XMEMSET(md2->buffer, 0, MD2_BLOCK_SIZE); |
48 | 0 | md2->count = 0; |
49 | 0 | } |
50 | | |
51 | | |
52 | | void wc_Md2Update(Md2* md2, const byte* data, word32 len) |
53 | 0 | { |
54 | 0 | static const byte S[256] = |
55 | 0 | { |
56 | 0 | 41, 46, 67, 201, 162, 216, 124, 1, 61, 54, 84, 161, 236, 240, 6, |
57 | 0 | 19, 98, 167, 5, 243, 192, 199, 115, 140, 152, 147, 43, 217, 188, |
58 | 0 | 76, 130, 202, 30, 155, 87, 60, 253, 212, 224, 22, 103, 66, 111, 24, |
59 | 0 | 138, 23, 229, 18, 190, 78, 196, 214, 218, 158, 222, 73, 160, 251, |
60 | 0 | 245, 142, 187, 47, 238, 122, 169, 104, 121, 145, 21, 178, 7, 63, |
61 | 0 | 148, 194, 16, 137, 11, 34, 95, 33, 128, 127, 93, 154, 90, 144, 50, |
62 | 0 | 39, 53, 62, 204, 231, 191, 247, 151, 3, 255, 25, 48, 179, 72, 165, |
63 | 0 | 181, 209, 215, 94, 146, 42, 172, 86, 170, 198, 79, 184, 56, 210, |
64 | 0 | 150, 164, 125, 182, 118, 252, 107, 226, 156, 116, 4, 241, 69, 157, |
65 | 0 | 112, 89, 100, 113, 135, 32, 134, 91, 207, 101, 230, 45, 168, 2, 27, |
66 | 0 | 96, 37, 173, 174, 176, 185, 246, 28, 70, 97, 105, 52, 64, 126, 15, |
67 | 0 | 85, 71, 163, 35, 221, 81, 175, 58, 195, 92, 249, 206, 186, 197, |
68 | 0 | 234, 38, 44, 83, 13, 110, 133, 40, 132, 9, 211, 223, 205, 244, 65, |
69 | 0 | 129, 77, 82, 106, 220, 55, 200, 108, 193, 171, 250, 36, 225, 123, |
70 | 0 | 8, 12, 189, 177, 74, 120, 136, 149, 139, 227, 99, 232, 109, 233, |
71 | 0 | 203, 213, 254, 59, 0, 29, 57, 242, 239, 183, 14, 102, 88, 208, 228, |
72 | 0 | 166, 119, 114, 248, 235, 117, 75, 10, 49, 68, 80, 180, 143, 237, |
73 | 0 | 31, 26, 219, 153, 141, 51, 159, 17, 131, 20 |
74 | 0 | }; |
75 | |
|
76 | 0 | while (len) { |
77 | 0 | word32 L = (MD2_PAD_SIZE - md2->count) < len ? |
78 | 0 | (MD2_PAD_SIZE - md2->count) : len; |
79 | 0 | XMEMCPY(md2->buffer + md2->count, data, L); |
80 | 0 | md2->count += L; |
81 | 0 | data += L; |
82 | 0 | len -= L; |
83 | |
|
84 | 0 | if (md2->count == MD2_PAD_SIZE) { |
85 | 0 | int i; |
86 | 0 | byte t; |
87 | |
|
88 | 0 | md2->count = 0; |
89 | 0 | XMEMCPY(md2->X + MD2_PAD_SIZE, md2->buffer, MD2_PAD_SIZE); |
90 | 0 | t = md2->C[15]; |
91 | |
|
92 | 0 | for(i = 0; i < MD2_PAD_SIZE; i++) { |
93 | 0 | md2->X[32 + i] = md2->X[MD2_PAD_SIZE + i] ^ md2->X[i]; |
94 | 0 | t = md2->C[i] ^= S[md2->buffer[i] ^ t]; |
95 | 0 | } |
96 | |
|
97 | 0 | t=0; |
98 | 0 | for(i = 0; i < 18; i++) { |
99 | 0 | int j; |
100 | 0 | for(j = 0; j < MD2_X_SIZE; j += 8) { |
101 | 0 | t = md2->X[j+0] ^= S[t]; |
102 | 0 | t = md2->X[j+1] ^= S[t]; |
103 | 0 | t = md2->X[j+2] ^= S[t]; |
104 | 0 | t = md2->X[j+3] ^= S[t]; |
105 | 0 | t = md2->X[j+4] ^= S[t]; |
106 | 0 | t = md2->X[j+5] ^= S[t]; |
107 | 0 | t = md2->X[j+6] ^= S[t]; |
108 | 0 | t = md2->X[j+7] ^= S[t]; |
109 | 0 | } |
110 | 0 | t = (t + i) & 0xFF; |
111 | 0 | } |
112 | 0 | } |
113 | 0 | } |
114 | 0 | } |
115 | | |
116 | | |
117 | | void wc_Md2Final(Md2* md2, byte* hash) |
118 | 0 | { |
119 | 0 | byte padding[MD2_BLOCK_SIZE]; |
120 | 0 | word32 padLen = MD2_PAD_SIZE - md2->count; |
121 | 0 | word32 i; |
122 | |
|
123 | 0 | for (i = 0; i < padLen; i++) |
124 | 0 | padding[i] = (byte)padLen; |
125 | |
|
126 | 0 | wc_Md2Update(md2, padding, padLen); |
127 | 0 | wc_Md2Update(md2, md2->C, MD2_BLOCK_SIZE); |
128 | |
|
129 | 0 | XMEMCPY(hash, md2->X, MD2_DIGEST_SIZE); |
130 | |
|
131 | 0 | wc_InitMd2(md2); |
132 | 0 | } |
133 | | |
134 | | |
135 | | int wc_Md2Hash(const byte* data, word32 len, byte* hash) |
136 | 0 | { |
137 | 0 | #ifdef WOLFSSL_SMALL_STACK |
138 | 0 | Md2* md2; |
139 | | #else |
140 | | Md2 md2[1]; |
141 | | #endif |
142 | |
|
143 | 0 | #ifdef WOLFSSL_SMALL_STACK |
144 | 0 | md2 = (Md2*)XMALLOC(sizeof(Md2), NULL, DYNAMIC_TYPE_TMP_BUFFER); |
145 | 0 | if (md2 == NULL) |
146 | 0 | return MEMORY_E; |
147 | 0 | #endif |
148 | | |
149 | 0 | wc_InitMd2(md2); |
150 | 0 | wc_Md2Update(md2, data, len); |
151 | 0 | wc_Md2Final(md2, hash); |
152 | |
|
153 | 0 | #ifdef WOLFSSL_SMALL_STACK |
154 | 0 | XFREE(md2, NULL, DYNAMIC_TYPE_TMP_BUFFER); |
155 | 0 | #endif |
156 | |
|
157 | 0 | return 0; |
158 | 0 | } |
159 | | |
160 | | |
161 | | #endif /* WOLFSSL_MD2 */ |
162 | | |