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