Line data Source code
1 : /* crypto/md4/md4_dgst.c */
2 : /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
3 : * All rights reserved.
4 : *
5 : * This package is an SSL implementation written
6 : * by Eric Young (eay@cryptsoft.com).
7 : * The implementation was written so as to conform with Netscapes SSL.
8 : *
9 : * This library is free for commercial and non-commercial use as long as
10 : * the following conditions are aheared to. The following conditions
11 : * apply to all code found in this distribution, be it the RC4, RSA,
12 : * lhash, DES, etc., code; not just the SSL code. The SSL documentation
13 : * included with this distribution is covered by the same copyright terms
14 : * except that the holder is Tim Hudson (tjh@cryptsoft.com).
15 : *
16 : * Copyright remains Eric Young's, and as such any Copyright notices in
17 : * the code are not to be removed.
18 : * If this package is used in a product, Eric Young should be given attribution
19 : * as the author of the parts of the library used.
20 : * This can be in the form of a textual message at program startup or
21 : * in documentation (online or textual) provided with the package.
22 : *
23 : * Redistribution and use in source and binary forms, with or without
24 : * modification, are permitted provided that the following conditions
25 : * are met:
26 : * 1. Redistributions of source code must retain the copyright
27 : * notice, this list of conditions and the following disclaimer.
28 : * 2. Redistributions in binary form must reproduce the above copyright
29 : * notice, this list of conditions and the following disclaimer in the
30 : * documentation and/or other materials provided with the distribution.
31 : * 3. All advertising materials mentioning features or use of this software
32 : * must display the following acknowledgement:
33 : * "This product includes cryptographic software written by
34 : * Eric Young (eay@cryptsoft.com)"
35 : * The word 'cryptographic' can be left out if the rouines from the library
36 : * being used are not cryptographic related :-).
37 : * 4. If you include any Windows specific code (or a derivative thereof) from
38 : * the apps directory (application code) you must include an acknowledgement:
39 : * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
40 : *
41 : * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
42 : * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
43 : * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
44 : * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
45 : * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
46 : * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
47 : * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
48 : * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
49 : * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
50 : * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
51 : * SUCH DAMAGE.
52 : *
53 : * The licence and distribution terms for any publically available version or
54 : * derivative of this code cannot be changed. i.e. this code cannot simply be
55 : * copied and put under another distribution licence
56 : * [including the GNU Public Licence.]
57 : */
58 :
59 : #include <stdio.h>
60 : #include <openssl/opensslv.h>
61 : #include <openssl/crypto.h>
62 : #include "md4_locl.h"
63 :
64 : const char MD4_version[] = "MD4" OPENSSL_VERSION_PTEXT;
65 :
66 : /*
67 : * Implemented from RFC1186 The MD4 Message-Digest Algorithm
68 : */
69 :
70 : #define INIT_DATA_A (unsigned long)0x67452301L
71 : #define INIT_DATA_B (unsigned long)0xefcdab89L
72 : #define INIT_DATA_C (unsigned long)0x98badcfeL
73 : #define INIT_DATA_D (unsigned long)0x10325476L
74 :
75 0 : fips_md_init(MD4)
76 : {
77 : memset(c, 0, sizeof(*c));
78 0 : c->A = INIT_DATA_A;
79 0 : c->B = INIT_DATA_B;
80 0 : c->C = INIT_DATA_C;
81 0 : c->D = INIT_DATA_D;
82 0 : return 1;
83 : }
84 :
85 : #ifndef md4_block_data_order
86 : # ifdef X
87 : # undef X
88 : # endif
89 0 : void md4_block_data_order(MD4_CTX *c, const void *data_, size_t num)
90 : {
91 : const unsigned char *data = data_;
92 : register unsigned MD32_REG_T A, B, C, D, l;
93 : # ifndef MD32_XARRAY
94 : /* See comment in crypto/sha/sha_locl.h for details. */
95 : unsigned MD32_REG_T XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7,
96 : XX8, XX9, XX10, XX11, XX12, XX13, XX14, XX15;
97 : # define X(i) XX##i
98 : # else
99 : MD4_LONG XX[MD4_LBLOCK];
100 : # define X(i) XX[i]
101 : # endif
102 :
103 0 : A = c->A;
104 0 : B = c->B;
105 0 : C = c->C;
106 0 : D = c->D;
107 :
108 0 : for (; num--;) {
109 0 : (void)HOST_c2l(data, l);
110 : X(0) = l;
111 0 : (void)HOST_c2l(data, l);
112 : X(1) = l;
113 : /* Round 0 */
114 0 : R0(A, B, C, D, X(0), 3, 0);
115 0 : (void)HOST_c2l(data, l);
116 : X(2) = l;
117 0 : R0(D, A, B, C, X(1), 7, 0);
118 0 : (void)HOST_c2l(data, l);
119 : X(3) = l;
120 0 : R0(C, D, A, B, X(2), 11, 0);
121 0 : (void)HOST_c2l(data, l);
122 : X(4) = l;
123 0 : R0(B, C, D, A, X(3), 19, 0);
124 0 : (void)HOST_c2l(data, l);
125 : X(5) = l;
126 0 : R0(A, B, C, D, X(4), 3, 0);
127 0 : (void)HOST_c2l(data, l);
128 : X(6) = l;
129 0 : R0(D, A, B, C, X(5), 7, 0);
130 0 : (void)HOST_c2l(data, l);
131 : X(7) = l;
132 0 : R0(C, D, A, B, X(6), 11, 0);
133 0 : (void)HOST_c2l(data, l);
134 : X(8) = l;
135 0 : R0(B, C, D, A, X(7), 19, 0);
136 0 : (void)HOST_c2l(data, l);
137 : X(9) = l;
138 0 : R0(A, B, C, D, X(8), 3, 0);
139 0 : (void)HOST_c2l(data, l);
140 : X(10) = l;
141 0 : R0(D, A, B, C, X(9), 7, 0);
142 0 : (void)HOST_c2l(data, l);
143 : X(11) = l;
144 0 : R0(C, D, A, B, X(10), 11, 0);
145 0 : (void)HOST_c2l(data, l);
146 : X(12) = l;
147 0 : R0(B, C, D, A, X(11), 19, 0);
148 0 : (void)HOST_c2l(data, l);
149 : X(13) = l;
150 0 : R0(A, B, C, D, X(12), 3, 0);
151 0 : (void)HOST_c2l(data, l);
152 : X(14) = l;
153 0 : R0(D, A, B, C, X(13), 7, 0);
154 0 : (void)HOST_c2l(data, l);
155 : X(15) = l;
156 0 : R0(C, D, A, B, X(14), 11, 0);
157 0 : R0(B, C, D, A, X(15), 19, 0);
158 : /* Round 1 */
159 0 : R1(A, B, C, D, X(0), 3, 0x5A827999L);
160 0 : R1(D, A, B, C, X(4), 5, 0x5A827999L);
161 0 : R1(C, D, A, B, X(8), 9, 0x5A827999L);
162 0 : R1(B, C, D, A, X(12), 13, 0x5A827999L);
163 0 : R1(A, B, C, D, X(1), 3, 0x5A827999L);
164 0 : R1(D, A, B, C, X(5), 5, 0x5A827999L);
165 0 : R1(C, D, A, B, X(9), 9, 0x5A827999L);
166 0 : R1(B, C, D, A, X(13), 13, 0x5A827999L);
167 0 : R1(A, B, C, D, X(2), 3, 0x5A827999L);
168 0 : R1(D, A, B, C, X(6), 5, 0x5A827999L);
169 0 : R1(C, D, A, B, X(10), 9, 0x5A827999L);
170 0 : R1(B, C, D, A, X(14), 13, 0x5A827999L);
171 0 : R1(A, B, C, D, X(3), 3, 0x5A827999L);
172 0 : R1(D, A, B, C, X(7), 5, 0x5A827999L);
173 0 : R1(C, D, A, B, X(11), 9, 0x5A827999L);
174 0 : R1(B, C, D, A, X(15), 13, 0x5A827999L);
175 : /* Round 2 */
176 0 : R2(A, B, C, D, X(0), 3, 0x6ED9EBA1L);
177 0 : R2(D, A, B, C, X(8), 9, 0x6ED9EBA1L);
178 0 : R2(C, D, A, B, X(4), 11, 0x6ED9EBA1L);
179 0 : R2(B, C, D, A, X(12), 15, 0x6ED9EBA1L);
180 0 : R2(A, B, C, D, X(2), 3, 0x6ED9EBA1L);
181 0 : R2(D, A, B, C, X(10), 9, 0x6ED9EBA1L);
182 0 : R2(C, D, A, B, X(6), 11, 0x6ED9EBA1L);
183 0 : R2(B, C, D, A, X(14), 15, 0x6ED9EBA1L);
184 0 : R2(A, B, C, D, X(1), 3, 0x6ED9EBA1L);
185 0 : R2(D, A, B, C, X(9), 9, 0x6ED9EBA1L);
186 0 : R2(C, D, A, B, X(5), 11, 0x6ED9EBA1L);
187 0 : R2(B, C, D, A, X(13), 15, 0x6ED9EBA1L);
188 0 : R2(A, B, C, D, X(3), 3, 0x6ED9EBA1L);
189 0 : R2(D, A, B, C, X(11), 9, 0x6ED9EBA1L);
190 0 : R2(C, D, A, B, X(7), 11, 0x6ED9EBA1L);
191 0 : R2(B, C, D, A, X(15), 15, 0x6ED9EBA1L);
192 :
193 0 : A = c->A += A;
194 0 : B = c->B += B;
195 0 : C = c->C += C;
196 0 : D = c->D += D;
197 : }
198 0 : }
199 : #endif
|