Coverage Report

Created: 2025-11-16 07:15

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