1*10465441SEvalZero /*
2*10465441SEvalZero * RFC 1186/1320 compliant MD4 implementation
3*10465441SEvalZero *
4*10465441SEvalZero * Based on XySSL: Copyright (C) 2006-2008 Christophe Devine
5*10465441SEvalZero *
6*10465441SEvalZero * Copyright (C) 2009 Paul Bakker <polarssl_maintainer at polarssl dot org>
7*10465441SEvalZero *
8*10465441SEvalZero * All rights reserved.
9*10465441SEvalZero *
10*10465441SEvalZero * Redistribution and use in source and binary forms, with or without
11*10465441SEvalZero * modification, are permitted provided that the following conditions
12*10465441SEvalZero * are met:
13*10465441SEvalZero *
14*10465441SEvalZero * * Redistributions of source code must retain the above copyright
15*10465441SEvalZero * notice, this list of conditions and the following disclaimer.
16*10465441SEvalZero * * Redistributions in binary form must reproduce the above copyright
17*10465441SEvalZero * notice, this list of conditions and the following disclaimer in the
18*10465441SEvalZero * documentation and/or other materials provided with the distribution.
19*10465441SEvalZero * * Neither the names of PolarSSL or XySSL nor the names of its contributors
20*10465441SEvalZero * may be used to endorse or promote products derived from this software
21*10465441SEvalZero * without specific prior written permission.
22*10465441SEvalZero *
23*10465441SEvalZero * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
24*10465441SEvalZero * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
25*10465441SEvalZero * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
26*10465441SEvalZero * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
27*10465441SEvalZero * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
28*10465441SEvalZero * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
29*10465441SEvalZero * TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
30*10465441SEvalZero * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
31*10465441SEvalZero * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
32*10465441SEvalZero * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
33*10465441SEvalZero * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
34*10465441SEvalZero */
35*10465441SEvalZero /*
36*10465441SEvalZero * The MD4 algorithm was designed by Ron Rivest in 1990.
37*10465441SEvalZero *
38*10465441SEvalZero * http://www.ietf.org/rfc/rfc1186.txt
39*10465441SEvalZero * http://www.ietf.org/rfc/rfc1320.txt
40*10465441SEvalZero */
41*10465441SEvalZero
42*10465441SEvalZero #include "netif/ppp/ppp_opts.h"
43*10465441SEvalZero #if PPP_SUPPORT && LWIP_INCLUDED_POLARSSL_MD4
44*10465441SEvalZero
45*10465441SEvalZero #include "netif/ppp/polarssl/md4.h"
46*10465441SEvalZero
47*10465441SEvalZero #include <string.h>
48*10465441SEvalZero
49*10465441SEvalZero /*
50*10465441SEvalZero * 32-bit integer manipulation macros (little endian)
51*10465441SEvalZero */
52*10465441SEvalZero #ifndef GET_ULONG_LE
53*10465441SEvalZero #define GET_ULONG_LE(n,b,i) \
54*10465441SEvalZero { \
55*10465441SEvalZero (n) = ( (unsigned long) (b)[(i) ] ) \
56*10465441SEvalZero | ( (unsigned long) (b)[(i) + 1] << 8 ) \
57*10465441SEvalZero | ( (unsigned long) (b)[(i) + 2] << 16 ) \
58*10465441SEvalZero | ( (unsigned long) (b)[(i) + 3] << 24 ); \
59*10465441SEvalZero }
60*10465441SEvalZero #endif
61*10465441SEvalZero
62*10465441SEvalZero #ifndef PUT_ULONG_LE
63*10465441SEvalZero #define PUT_ULONG_LE(n,b,i) \
64*10465441SEvalZero { \
65*10465441SEvalZero (b)[(i) ] = (unsigned char) ( (n) ); \
66*10465441SEvalZero (b)[(i) + 1] = (unsigned char) ( (n) >> 8 ); \
67*10465441SEvalZero (b)[(i) + 2] = (unsigned char) ( (n) >> 16 ); \
68*10465441SEvalZero (b)[(i) + 3] = (unsigned char) ( (n) >> 24 ); \
69*10465441SEvalZero }
70*10465441SEvalZero #endif
71*10465441SEvalZero
72*10465441SEvalZero /*
73*10465441SEvalZero * MD4 context setup
74*10465441SEvalZero */
md4_starts(md4_context * ctx)75*10465441SEvalZero void md4_starts( md4_context *ctx )
76*10465441SEvalZero {
77*10465441SEvalZero ctx->total[0] = 0;
78*10465441SEvalZero ctx->total[1] = 0;
79*10465441SEvalZero
80*10465441SEvalZero ctx->state[0] = 0x67452301;
81*10465441SEvalZero ctx->state[1] = 0xEFCDAB89;
82*10465441SEvalZero ctx->state[2] = 0x98BADCFE;
83*10465441SEvalZero ctx->state[3] = 0x10325476;
84*10465441SEvalZero }
85*10465441SEvalZero
md4_process(md4_context * ctx,const unsigned char data[64])86*10465441SEvalZero static void md4_process( md4_context *ctx, const unsigned char data[64] )
87*10465441SEvalZero {
88*10465441SEvalZero unsigned long X[16], A, B, C, D;
89*10465441SEvalZero
90*10465441SEvalZero GET_ULONG_LE( X[ 0], data, 0 );
91*10465441SEvalZero GET_ULONG_LE( X[ 1], data, 4 );
92*10465441SEvalZero GET_ULONG_LE( X[ 2], data, 8 );
93*10465441SEvalZero GET_ULONG_LE( X[ 3], data, 12 );
94*10465441SEvalZero GET_ULONG_LE( X[ 4], data, 16 );
95*10465441SEvalZero GET_ULONG_LE( X[ 5], data, 20 );
96*10465441SEvalZero GET_ULONG_LE( X[ 6], data, 24 );
97*10465441SEvalZero GET_ULONG_LE( X[ 7], data, 28 );
98*10465441SEvalZero GET_ULONG_LE( X[ 8], data, 32 );
99*10465441SEvalZero GET_ULONG_LE( X[ 9], data, 36 );
100*10465441SEvalZero GET_ULONG_LE( X[10], data, 40 );
101*10465441SEvalZero GET_ULONG_LE( X[11], data, 44 );
102*10465441SEvalZero GET_ULONG_LE( X[12], data, 48 );
103*10465441SEvalZero GET_ULONG_LE( X[13], data, 52 );
104*10465441SEvalZero GET_ULONG_LE( X[14], data, 56 );
105*10465441SEvalZero GET_ULONG_LE( X[15], data, 60 );
106*10465441SEvalZero
107*10465441SEvalZero #define S(x,n) ((x << n) | ((x & 0xFFFFFFFF) >> (32 - n)))
108*10465441SEvalZero
109*10465441SEvalZero A = ctx->state[0];
110*10465441SEvalZero B = ctx->state[1];
111*10465441SEvalZero C = ctx->state[2];
112*10465441SEvalZero D = ctx->state[3];
113*10465441SEvalZero
114*10465441SEvalZero #define F(x, y, z) ((x & y) | ((~x) & z))
115*10465441SEvalZero #define P(a,b,c,d,x,s) { a += F(b,c,d) + x; a = S(a,s); }
116*10465441SEvalZero
117*10465441SEvalZero P( A, B, C, D, X[ 0], 3 );
118*10465441SEvalZero P( D, A, B, C, X[ 1], 7 );
119*10465441SEvalZero P( C, D, A, B, X[ 2], 11 );
120*10465441SEvalZero P( B, C, D, A, X[ 3], 19 );
121*10465441SEvalZero P( A, B, C, D, X[ 4], 3 );
122*10465441SEvalZero P( D, A, B, C, X[ 5], 7 );
123*10465441SEvalZero P( C, D, A, B, X[ 6], 11 );
124*10465441SEvalZero P( B, C, D, A, X[ 7], 19 );
125*10465441SEvalZero P( A, B, C, D, X[ 8], 3 );
126*10465441SEvalZero P( D, A, B, C, X[ 9], 7 );
127*10465441SEvalZero P( C, D, A, B, X[10], 11 );
128*10465441SEvalZero P( B, C, D, A, X[11], 19 );
129*10465441SEvalZero P( A, B, C, D, X[12], 3 );
130*10465441SEvalZero P( D, A, B, C, X[13], 7 );
131*10465441SEvalZero P( C, D, A, B, X[14], 11 );
132*10465441SEvalZero P( B, C, D, A, X[15], 19 );
133*10465441SEvalZero
134*10465441SEvalZero #undef P
135*10465441SEvalZero #undef F
136*10465441SEvalZero
137*10465441SEvalZero #define F(x,y,z) ((x & y) | (x & z) | (y & z))
138*10465441SEvalZero #define P(a,b,c,d,x,s) { a += F(b,c,d) + x + 0x5A827999; a = S(a,s); }
139*10465441SEvalZero
140*10465441SEvalZero P( A, B, C, D, X[ 0], 3 );
141*10465441SEvalZero P( D, A, B, C, X[ 4], 5 );
142*10465441SEvalZero P( C, D, A, B, X[ 8], 9 );
143*10465441SEvalZero P( B, C, D, A, X[12], 13 );
144*10465441SEvalZero P( A, B, C, D, X[ 1], 3 );
145*10465441SEvalZero P( D, A, B, C, X[ 5], 5 );
146*10465441SEvalZero P( C, D, A, B, X[ 9], 9 );
147*10465441SEvalZero P( B, C, D, A, X[13], 13 );
148*10465441SEvalZero P( A, B, C, D, X[ 2], 3 );
149*10465441SEvalZero P( D, A, B, C, X[ 6], 5 );
150*10465441SEvalZero P( C, D, A, B, X[10], 9 );
151*10465441SEvalZero P( B, C, D, A, X[14], 13 );
152*10465441SEvalZero P( A, B, C, D, X[ 3], 3 );
153*10465441SEvalZero P( D, A, B, C, X[ 7], 5 );
154*10465441SEvalZero P( C, D, A, B, X[11], 9 );
155*10465441SEvalZero P( B, C, D, A, X[15], 13 );
156*10465441SEvalZero
157*10465441SEvalZero #undef P
158*10465441SEvalZero #undef F
159*10465441SEvalZero
160*10465441SEvalZero #define F(x,y,z) (x ^ y ^ z)
161*10465441SEvalZero #define P(a,b,c,d,x,s) { a += F(b,c,d) + x + 0x6ED9EBA1; a = S(a,s); }
162*10465441SEvalZero
163*10465441SEvalZero P( A, B, C, D, X[ 0], 3 );
164*10465441SEvalZero P( D, A, B, C, X[ 8], 9 );
165*10465441SEvalZero P( C, D, A, B, X[ 4], 11 );
166*10465441SEvalZero P( B, C, D, A, X[12], 15 );
167*10465441SEvalZero P( A, B, C, D, X[ 2], 3 );
168*10465441SEvalZero P( D, A, B, C, X[10], 9 );
169*10465441SEvalZero P( C, D, A, B, X[ 6], 11 );
170*10465441SEvalZero P( B, C, D, A, X[14], 15 );
171*10465441SEvalZero P( A, B, C, D, X[ 1], 3 );
172*10465441SEvalZero P( D, A, B, C, X[ 9], 9 );
173*10465441SEvalZero P( C, D, A, B, X[ 5], 11 );
174*10465441SEvalZero P( B, C, D, A, X[13], 15 );
175*10465441SEvalZero P( A, B, C, D, X[ 3], 3 );
176*10465441SEvalZero P( D, A, B, C, X[11], 9 );
177*10465441SEvalZero P( C, D, A, B, X[ 7], 11 );
178*10465441SEvalZero P( B, C, D, A, X[15], 15 );
179*10465441SEvalZero
180*10465441SEvalZero #undef F
181*10465441SEvalZero #undef P
182*10465441SEvalZero
183*10465441SEvalZero ctx->state[0] += A;
184*10465441SEvalZero ctx->state[1] += B;
185*10465441SEvalZero ctx->state[2] += C;
186*10465441SEvalZero ctx->state[3] += D;
187*10465441SEvalZero }
188*10465441SEvalZero
189*10465441SEvalZero /*
190*10465441SEvalZero * MD4 process buffer
191*10465441SEvalZero */
md4_update(md4_context * ctx,const unsigned char * input,int ilen)192*10465441SEvalZero void md4_update( md4_context *ctx, const unsigned char *input, int ilen )
193*10465441SEvalZero {
194*10465441SEvalZero int fill;
195*10465441SEvalZero unsigned long left;
196*10465441SEvalZero
197*10465441SEvalZero if( ilen <= 0 )
198*10465441SEvalZero return;
199*10465441SEvalZero
200*10465441SEvalZero left = ctx->total[0] & 0x3F;
201*10465441SEvalZero fill = 64 - left;
202*10465441SEvalZero
203*10465441SEvalZero ctx->total[0] += ilen;
204*10465441SEvalZero ctx->total[0] &= 0xFFFFFFFF;
205*10465441SEvalZero
206*10465441SEvalZero if( ctx->total[0] < (unsigned long) ilen )
207*10465441SEvalZero ctx->total[1]++;
208*10465441SEvalZero
209*10465441SEvalZero if( left && ilen >= fill )
210*10465441SEvalZero {
211*10465441SEvalZero MEMCPY( (void *) (ctx->buffer + left),
212*10465441SEvalZero input, fill );
213*10465441SEvalZero md4_process( ctx, ctx->buffer );
214*10465441SEvalZero input += fill;
215*10465441SEvalZero ilen -= fill;
216*10465441SEvalZero left = 0;
217*10465441SEvalZero }
218*10465441SEvalZero
219*10465441SEvalZero while( ilen >= 64 )
220*10465441SEvalZero {
221*10465441SEvalZero md4_process( ctx, input );
222*10465441SEvalZero input += 64;
223*10465441SEvalZero ilen -= 64;
224*10465441SEvalZero }
225*10465441SEvalZero
226*10465441SEvalZero if( ilen > 0 )
227*10465441SEvalZero {
228*10465441SEvalZero MEMCPY( (void *) (ctx->buffer + left),
229*10465441SEvalZero input, ilen );
230*10465441SEvalZero }
231*10465441SEvalZero }
232*10465441SEvalZero
233*10465441SEvalZero static const unsigned char md4_padding[64] =
234*10465441SEvalZero {
235*10465441SEvalZero 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
236*10465441SEvalZero 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
237*10465441SEvalZero 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
238*10465441SEvalZero 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
239*10465441SEvalZero };
240*10465441SEvalZero
241*10465441SEvalZero /*
242*10465441SEvalZero * MD4 final digest
243*10465441SEvalZero */
md4_finish(md4_context * ctx,unsigned char output[16])244*10465441SEvalZero void md4_finish( md4_context *ctx, unsigned char output[16] )
245*10465441SEvalZero {
246*10465441SEvalZero unsigned long last, padn;
247*10465441SEvalZero unsigned long high, low;
248*10465441SEvalZero unsigned char msglen[8];
249*10465441SEvalZero
250*10465441SEvalZero high = ( ctx->total[0] >> 29 )
251*10465441SEvalZero | ( ctx->total[1] << 3 );
252*10465441SEvalZero low = ( ctx->total[0] << 3 );
253*10465441SEvalZero
254*10465441SEvalZero PUT_ULONG_LE( low, msglen, 0 );
255*10465441SEvalZero PUT_ULONG_LE( high, msglen, 4 );
256*10465441SEvalZero
257*10465441SEvalZero last = ctx->total[0] & 0x3F;
258*10465441SEvalZero padn = ( last < 56 ) ? ( 56 - last ) : ( 120 - last );
259*10465441SEvalZero
260*10465441SEvalZero md4_update( ctx, md4_padding, padn );
261*10465441SEvalZero md4_update( ctx, msglen, 8 );
262*10465441SEvalZero
263*10465441SEvalZero PUT_ULONG_LE( ctx->state[0], output, 0 );
264*10465441SEvalZero PUT_ULONG_LE( ctx->state[1], output, 4 );
265*10465441SEvalZero PUT_ULONG_LE( ctx->state[2], output, 8 );
266*10465441SEvalZero PUT_ULONG_LE( ctx->state[3], output, 12 );
267*10465441SEvalZero }
268*10465441SEvalZero
269*10465441SEvalZero /*
270*10465441SEvalZero * output = MD4( input buffer )
271*10465441SEvalZero */
md4(unsigned char * input,int ilen,unsigned char output[16])272*10465441SEvalZero void md4( unsigned char *input, int ilen, unsigned char output[16] )
273*10465441SEvalZero {
274*10465441SEvalZero md4_context ctx;
275*10465441SEvalZero
276*10465441SEvalZero md4_starts( &ctx );
277*10465441SEvalZero md4_update( &ctx, input, ilen );
278*10465441SEvalZero md4_finish( &ctx, output );
279*10465441SEvalZero }
280*10465441SEvalZero
281*10465441SEvalZero #endif /* PPP_SUPPORT && LWIP_INCLUDED_POLARSSL_MD4 */
282