/src/wolfssl-heapmath/wolfcrypt/src/md4.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* md4.c |
2 | | * |
3 | | * Copyright (C) 2006-2025 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 3 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 | | #include <wolfssl/wolfcrypt/libwolfssl_sources.h> |
23 | | |
24 | | #ifndef NO_MD4 |
25 | | |
26 | | #include <wolfssl/wolfcrypt/md4.h> |
27 | | #ifdef NO_INLINE |
28 | | #include <wolfssl/wolfcrypt/misc.h> |
29 | | #else |
30 | | #define WOLFSSL_MISC_INCLUDED |
31 | | #include <wolfcrypt/src/misc.c> |
32 | | #endif |
33 | | |
34 | | |
35 | | void wc_InitMd4(wc_Md4* md4) |
36 | 312 | { |
37 | 312 | if (md4 == NULL) |
38 | 0 | return; |
39 | | |
40 | 312 | md4->digest[0] = 0x67452301L; |
41 | 312 | md4->digest[1] = 0xefcdab89L; |
42 | 312 | md4->digest[2] = 0x98badcfeL; |
43 | 312 | md4->digest[3] = 0x10325476L; |
44 | | |
45 | 312 | md4->buffLen = 0; |
46 | 312 | md4->loLen = 0; |
47 | 312 | md4->hiLen = 0; |
48 | 312 | } |
49 | | |
50 | | |
51 | | static void Transform(wc_Md4* md4) |
52 | 1.57k | { |
53 | 25.2k | #define F(x, y, z) ((z) ^ ((x) & ((y) ^ (z)))) |
54 | 25.2k | #define G(x, y, z) (((x) & (y)) | ((x) & (z)) | ((y) & (z))) |
55 | 25.2k | #define H(x, y, z) ((x) ^ (y) ^ (z)) |
56 | | |
57 | | /* Copy context->state[] to working vars */ |
58 | 1.57k | word32 A = md4->digest[0]; |
59 | 1.57k | word32 B = md4->digest[1]; |
60 | 1.57k | word32 C = md4->digest[2]; |
61 | 1.57k | word32 D = md4->digest[3]; |
62 | | |
63 | 25.2k | #define function(a,b,c,d,k,s) (a)=rotlFixed((a)+F(b,c,d)+md4->buffer[k],s); |
64 | 1.57k | function(A,B,C,D, 0, 3); |
65 | 1.57k | function(D,A,B,C, 1, 7); |
66 | 1.57k | function(C,D,A,B, 2,11); |
67 | 1.57k | function(B,C,D,A, 3,19); |
68 | 1.57k | function(A,B,C,D, 4, 3); |
69 | 1.57k | function(D,A,B,C, 5, 7); |
70 | 1.57k | function(C,D,A,B, 6,11); |
71 | 1.57k | function(B,C,D,A, 7,19); |
72 | 1.57k | function(A,B,C,D, 8, 3); |
73 | 1.57k | function(D,A,B,C, 9, 7); |
74 | 1.57k | function(C,D,A,B,10,11); |
75 | 1.57k | function(B,C,D,A,11,19); |
76 | 1.57k | function(A,B,C,D,12, 3); |
77 | 1.57k | function(D,A,B,C,13, 7); |
78 | 1.57k | function(C,D,A,B,14,11); |
79 | 1.57k | function(B,C,D,A,15,19); |
80 | | |
81 | 1.57k | #undef function |
82 | 1.57k | #define function(a,b,c,d,k,s) \ |
83 | 25.2k | (a)=rotlFixed((a)+G(b,c,d)+md4->buffer[k]+0x5a827999,s); |
84 | | |
85 | 1.57k | function(A,B,C,D, 0, 3); |
86 | 1.57k | function(D,A,B,C, 4, 5); |
87 | 1.57k | function(C,D,A,B, 8, 9); |
88 | 1.57k | function(B,C,D,A,12,13); |
89 | 1.57k | function(A,B,C,D, 1, 3); |
90 | 1.57k | function(D,A,B,C, 5, 5); |
91 | 1.57k | function(C,D,A,B, 9, 9); |
92 | 1.57k | function(B,C,D,A,13,13); |
93 | 1.57k | function(A,B,C,D, 2, 3); |
94 | 1.57k | function(D,A,B,C, 6, 5); |
95 | 1.57k | function(C,D,A,B,10, 9); |
96 | 1.57k | function(B,C,D,A,14,13); |
97 | 1.57k | function(A,B,C,D, 3, 3); |
98 | 1.57k | function(D,A,B,C, 7, 5); |
99 | 1.57k | function(C,D,A,B,11, 9); |
100 | 1.57k | function(B,C,D,A,15,13); |
101 | | |
102 | 1.57k | #undef function |
103 | 1.57k | #define function(a,b,c,d,k,s) \ |
104 | 25.2k | (a)=rotlFixed((a)+H(b,c,d)+md4->buffer[k]+0x6ed9eba1,s); |
105 | | |
106 | 1.57k | function(A,B,C,D, 0, 3); |
107 | 1.57k | function(D,A,B,C, 8, 9); |
108 | 1.57k | function(C,D,A,B, 4,11); |
109 | 1.57k | function(B,C,D,A,12,15); |
110 | 1.57k | function(A,B,C,D, 2, 3); |
111 | 1.57k | function(D,A,B,C,10, 9); |
112 | 1.57k | function(C,D,A,B, 6,11); |
113 | 1.57k | function(B,C,D,A,14,15); |
114 | 1.57k | function(A,B,C,D, 1, 3); |
115 | 1.57k | function(D,A,B,C, 9, 9); |
116 | 1.57k | function(C,D,A,B, 5,11); |
117 | 1.57k | function(B,C,D,A,13,15); |
118 | 1.57k | function(A,B,C,D, 3, 3); |
119 | 1.57k | function(D,A,B,C,11, 9); |
120 | 1.57k | function(C,D,A,B, 7,11); |
121 | 1.57k | function(B,C,D,A,15,15); |
122 | | |
123 | | /* Add the working vars back into digest state[] */ |
124 | 1.57k | md4->digest[0] += A; |
125 | 1.57k | md4->digest[1] += B; |
126 | 1.57k | md4->digest[2] += C; |
127 | 1.57k | md4->digest[3] += D; |
128 | 1.57k | } |
129 | | |
130 | | |
131 | | static WC_INLINE void AddLength(wc_Md4* md4, word32 len) |
132 | 1.55k | { |
133 | 1.55k | word32 tmp = md4->loLen; |
134 | 1.55k | if ( (md4->loLen += len) < tmp) |
135 | 0 | md4->hiLen++; /* carry low to high */ |
136 | 1.55k | } |
137 | | |
138 | | |
139 | | void wc_Md4Update(wc_Md4* md4, const byte* data, word32 len) |
140 | 2.03k | { |
141 | | /* do block size increments */ |
142 | 2.03k | byte* local; |
143 | | |
144 | 2.03k | if (md4 == NULL || (data == NULL && len != 0)) |
145 | 0 | return; |
146 | | |
147 | 2.03k | local = (byte*)md4->buffer; |
148 | 3.90k | while (len) { |
149 | 1.86k | word32 add = min(len, WC_MD4_BLOCK_SIZE - md4->buffLen); |
150 | 1.86k | XMEMCPY(&local[md4->buffLen], data, add); |
151 | | |
152 | 1.86k | md4->buffLen += add; |
153 | 1.86k | data += add; |
154 | 1.86k | len -= add; |
155 | | |
156 | 1.86k | if (md4->buffLen == WC_MD4_BLOCK_SIZE) { |
157 | | #ifdef BIG_ENDIAN_ORDER |
158 | | ByteReverseWords(md4->buffer, md4->buffer, WC_MD4_BLOCK_SIZE); |
159 | | #endif |
160 | 1.39k | Transform(md4); |
161 | 1.39k | AddLength(md4, WC_MD4_BLOCK_SIZE); |
162 | 1.39k | md4->buffLen = 0; |
163 | 1.39k | } |
164 | 1.86k | } |
165 | 2.03k | } |
166 | | |
167 | | |
168 | | void wc_Md4Final(wc_Md4* md4, byte* hash) |
169 | 156 | { |
170 | 156 | byte* local; |
171 | | |
172 | 156 | if (md4 == NULL || hash == NULL) |
173 | 0 | return; |
174 | | |
175 | 156 | local = (byte*)md4->buffer; |
176 | 156 | AddLength(md4, md4->buffLen); /* before adding pads */ |
177 | | |
178 | 156 | local[md4->buffLen++] = 0x80; /* add 1 */ |
179 | | |
180 | | /* pad with zeros */ |
181 | 156 | if (md4->buffLen > WC_MD4_PAD_SIZE) { |
182 | 24 | XMEMSET(&local[md4->buffLen], 0, WC_MD4_BLOCK_SIZE - md4->buffLen); |
183 | 24 | md4->buffLen += WC_MD4_BLOCK_SIZE - md4->buffLen; |
184 | | |
185 | | #ifdef BIG_ENDIAN_ORDER |
186 | | ByteReverseWords(md4->buffer, md4->buffer, WC_MD4_BLOCK_SIZE); |
187 | | #endif |
188 | 24 | Transform(md4); |
189 | 24 | md4->buffLen = 0; |
190 | 24 | } |
191 | 156 | XMEMSET(&local[md4->buffLen], 0, WC_MD4_PAD_SIZE - md4->buffLen); |
192 | | |
193 | | /* put lengths in bits */ |
194 | 156 | md4->hiLen = (md4->loLen >> (8*sizeof(md4->loLen) - 3)) + |
195 | 156 | (md4->hiLen << 3); |
196 | 156 | md4->loLen = md4->loLen << 3; |
197 | | |
198 | | /* store lengths */ |
199 | | #ifdef BIG_ENDIAN_ORDER |
200 | | ByteReverseWords(md4->buffer, md4->buffer, WC_MD4_BLOCK_SIZE); |
201 | | #endif |
202 | | /* ! length ordering dependent on digest endian type ! */ |
203 | 156 | XMEMCPY(&local[WC_MD4_PAD_SIZE], &md4->loLen, sizeof(word32)); |
204 | 156 | XMEMCPY(&local[WC_MD4_PAD_SIZE + sizeof(word32)], &md4->hiLen, sizeof(word32)); |
205 | | |
206 | 156 | Transform(md4); |
207 | | #ifdef BIG_ENDIAN_ORDER |
208 | | ByteReverseWords(md4->digest, md4->digest, WC_MD4_DIGEST_SIZE); |
209 | | #endif |
210 | 156 | XMEMCPY(hash, md4->digest, WC_MD4_DIGEST_SIZE); |
211 | | |
212 | 156 | wc_InitMd4(md4); /* reset state */ |
213 | 156 | } |
214 | | |
215 | | |
216 | | #endif /* NO_MD4 */ |
217 | | |