Coverage Report

Created: 2026-08-15 06:21

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