Coverage Report

Created: 2023-06-08 06:41

/src/openssl111/crypto/md4/md4_dgst.c
Line
Count
Source (jump to first uncovered line)
1
/*
2
 * Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved.
3
 *
4
 * Licensed under the OpenSSL license (the "License").  You may not use
5
 * this file except in compliance with the License.  You can obtain a copy
6
 * in the file LICENSE in the source distribution or at
7
 * https://www.openssl.org/source/license.html
8
 */
9
10
#include <stdio.h>
11
#include <openssl/opensslv.h>
12
#include "md4_local.h"
13
14
/*
15
 * Implemented from RFC1186 The MD4 Message-Digest Algorithm
16
 */
17
18
0
#define INIT_DATA_A (unsigned long)0x67452301L
19
0
#define INIT_DATA_B (unsigned long)0xefcdab89L
20
0
#define INIT_DATA_C (unsigned long)0x98badcfeL
21
0
#define INIT_DATA_D (unsigned long)0x10325476L
22
23
int MD4_Init(MD4_CTX *c)
24
0
{
25
0
    memset(c, 0, sizeof(*c));
26
0
    c->A = INIT_DATA_A;
27
0
    c->B = INIT_DATA_B;
28
0
    c->C = INIT_DATA_C;
29
0
    c->D = INIT_DATA_D;
30
0
    return 1;
31
0
}
32
33
#ifndef md4_block_data_order
34
# ifdef X
35
#  undef X
36
# endif
37
void md4_block_data_order(MD4_CTX *c, const void *data_, size_t num)
38
0
{
39
0
    const unsigned char *data = data_;
40
0
    register unsigned MD32_REG_T A, B, C, D, l;
41
0
# ifndef MD32_XARRAY
42
    /* See comment in crypto/sha/sha_local.h for details. */
43
0
    unsigned MD32_REG_T XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7,
44
0
        XX8, XX9, XX10, XX11, XX12, XX13, XX14, XX15;
45
0
#  define X(i)   XX##i
46
# else
47
    MD4_LONG XX[MD4_LBLOCK];
48
#  define X(i)   XX[i]
49
# endif
50
51
0
    A = c->A;
52
0
    B = c->B;
53
0
    C = c->C;
54
0
    D = c->D;
55
56
0
    for (; num--;) {
57
0
        (void)HOST_c2l(data, l);
58
0
        X(0) = l;
59
0
        (void)HOST_c2l(data, l);
60
0
        X(1) = l;
61
        /* Round 0 */
62
0
        R0(A, B, C, D, X(0), 3, 0);
63
0
        (void)HOST_c2l(data, l);
64
0
        X(2) = l;
65
0
        R0(D, A, B, C, X(1), 7, 0);
66
0
        (void)HOST_c2l(data, l);
67
0
        X(3) = l;
68
0
        R0(C, D, A, B, X(2), 11, 0);
69
0
        (void)HOST_c2l(data, l);
70
0
        X(4) = l;
71
0
        R0(B, C, D, A, X(3), 19, 0);
72
0
        (void)HOST_c2l(data, l);
73
0
        X(5) = l;
74
0
        R0(A, B, C, D, X(4), 3, 0);
75
0
        (void)HOST_c2l(data, l);
76
0
        X(6) = l;
77
0
        R0(D, A, B, C, X(5), 7, 0);
78
0
        (void)HOST_c2l(data, l);
79
0
        X(7) = l;
80
0
        R0(C, D, A, B, X(6), 11, 0);
81
0
        (void)HOST_c2l(data, l);
82
0
        X(8) = l;
83
0
        R0(B, C, D, A, X(7), 19, 0);
84
0
        (void)HOST_c2l(data, l);
85
0
        X(9) = l;
86
0
        R0(A, B, C, D, X(8), 3, 0);
87
0
        (void)HOST_c2l(data, l);
88
0
        X(10) = l;
89
0
        R0(D, A, B, C, X(9), 7, 0);
90
0
        (void)HOST_c2l(data, l);
91
0
        X(11) = l;
92
0
        R0(C, D, A, B, X(10), 11, 0);
93
0
        (void)HOST_c2l(data, l);
94
0
        X(12) = l;
95
0
        R0(B, C, D, A, X(11), 19, 0);
96
0
        (void)HOST_c2l(data, l);
97
0
        X(13) = l;
98
0
        R0(A, B, C, D, X(12), 3, 0);
99
0
        (void)HOST_c2l(data, l);
100
0
        X(14) = l;
101
0
        R0(D, A, B, C, X(13), 7, 0);
102
0
        (void)HOST_c2l(data, l);
103
0
        X(15) = l;
104
0
        R0(C, D, A, B, X(14), 11, 0);
105
0
        R0(B, C, D, A, X(15), 19, 0);
106
        /* Round 1 */
107
0
        R1(A, B, C, D, X(0), 3, 0x5A827999L);
108
0
        R1(D, A, B, C, X(4), 5, 0x5A827999L);
109
0
        R1(C, D, A, B, X(8), 9, 0x5A827999L);
110
0
        R1(B, C, D, A, X(12), 13, 0x5A827999L);
111
0
        R1(A, B, C, D, X(1), 3, 0x5A827999L);
112
0
        R1(D, A, B, C, X(5), 5, 0x5A827999L);
113
0
        R1(C, D, A, B, X(9), 9, 0x5A827999L);
114
0
        R1(B, C, D, A, X(13), 13, 0x5A827999L);
115
0
        R1(A, B, C, D, X(2), 3, 0x5A827999L);
116
0
        R1(D, A, B, C, X(6), 5, 0x5A827999L);
117
0
        R1(C, D, A, B, X(10), 9, 0x5A827999L);
118
0
        R1(B, C, D, A, X(14), 13, 0x5A827999L);
119
0
        R1(A, B, C, D, X(3), 3, 0x5A827999L);
120
0
        R1(D, A, B, C, X(7), 5, 0x5A827999L);
121
0
        R1(C, D, A, B, X(11), 9, 0x5A827999L);
122
0
        R1(B, C, D, A, X(15), 13, 0x5A827999L);
123
        /* Round 2 */
124
0
        R2(A, B, C, D, X(0), 3, 0x6ED9EBA1L);
125
0
        R2(D, A, B, C, X(8), 9, 0x6ED9EBA1L);
126
0
        R2(C, D, A, B, X(4), 11, 0x6ED9EBA1L);
127
0
        R2(B, C, D, A, X(12), 15, 0x6ED9EBA1L);
128
0
        R2(A, B, C, D, X(2), 3, 0x6ED9EBA1L);
129
0
        R2(D, A, B, C, X(10), 9, 0x6ED9EBA1L);
130
0
        R2(C, D, A, B, X(6), 11, 0x6ED9EBA1L);
131
0
        R2(B, C, D, A, X(14), 15, 0x6ED9EBA1L);
132
0
        R2(A, B, C, D, X(1), 3, 0x6ED9EBA1L);
133
0
        R2(D, A, B, C, X(9), 9, 0x6ED9EBA1L);
134
0
        R2(C, D, A, B, X(5), 11, 0x6ED9EBA1L);
135
0
        R2(B, C, D, A, X(13), 15, 0x6ED9EBA1L);
136
0
        R2(A, B, C, D, X(3), 3, 0x6ED9EBA1L);
137
0
        R2(D, A, B, C, X(11), 9, 0x6ED9EBA1L);
138
0
        R2(C, D, A, B, X(7), 11, 0x6ED9EBA1L);
139
0
        R2(B, C, D, A, X(15), 15, 0x6ED9EBA1L);
140
141
0
        A = c->A += A;
142
0
        B = c->B += B;
143
0
        C = c->C += C;
144
0
        D = c->D += D;
145
0
    }
146
0
}
147
#endif