src/core/md4.c

   1 /* vim:set ts=2 sw=2 et cindent: */
   2 /* ***** BEGIN LICENSE BLOCK *****
   3  * Version: MPL 1.1/GPL 2.0/LGPL 2.1
   4  *
   5  * The contents of this file are subject to the Mozilla Public License Version
   6  * 1.1 (the "License"); you may not use this file except in compliance with
   7  * the License. You may obtain a copy of the License at
   8  * http://www.mozilla.org/MPL/
   9  *
  10  * Software distributed under the License is distributed on an "AS IS" basis,
  11  * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
  12  * for the specific language governing rights and limitations under the
  13  * License.
  14  *
  15  * The Original Code is Mozilla.
  16  *
  17  * The Initial Developer of the Original Code is IBM Corporation.
  18  * Portions created by IBM Corporation are Copyright (C) 2003
  19  * IBM Corporation. All Rights Reserved.
  20  *
  21  * Contributor(s):
  22  *   Darin Fisher <darin@meer.net>
  23  *
  24  * Alternatively, the contents of this file may be used under the terms of
  25  * either the GNU General Public License Version 2 or later (the "GPL"), or
  26  * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
  27  * in which case the provisions of the GPL or the LGPL are applicable instead
  28  * of those above. If you wish to allow use of your version of this file only
  29  * under the terms of either the GPL or the LGPL, and not to allow others to
  30  * use your version of this file under the terms of the MPL, indicate your
  31  * decision by deleting the provisions above and replace them with the notice
  32  * and other provisions required by the GPL or the LGPL. If you do not delete
  33  * the provisions above, a recipient may use your version of this file under
  34  * the terms of any one of the MPL, the GPL or the LGPL.
  35  *
  36  * ***** END LICENSE BLOCK ***** */
  37
  38 /*
  39  * Non-functional changes to remove dependencies on NSS headers
  40  *
  41  * Changes are flagged with __SIPE__REMOVE_NSS_DEPENDENCIES__
  42  *
  43  * Copyright (C) 2011 SIPE Project <http://sipe.sourceforge.net/>
  44  */
  45
  46 /*
  47  * "clean room" MD4 implementation (see RFC 1320)
  48  */
  49
  50 #ifdef __SIPE__REMOVE_NSS_DEPENDENCIES__
  51 #else
  52 #include <glib.h>
  53 #endif /* __SIPE__REMOVE_NSS_DEPENDENCIES__ */
  54
  55 #include <string.h>
  56 #include "md4.h"
  57
  58 typedef PRUint32 Uint32;
  59 typedef PRUint8 Uint8;
  60
  61 /* the "conditional" function */
  62 #define F(x,y,z) (((x) & (y)) | (~(x) & (z)))
  63
  64 /* the "majority" function */
  65 #define G(x,y,z) (((x) & (y)) | ((x) & (z)) | ((y) & (z)))
  66
  67 /* the "parity" function */
  68 #define H(x,y,z) ((x) ^ (y) ^ (z))
  69
  70 /* rotate n-bits to the left */
  71 #define ROTL(x,n) (((x) << (n)) | ((x) >> (0x20 - n)))
  72
  73 /* round 1: [abcd k s]: a = (a + F(b,c,d) + X[k]) <<< s */
  74 #define RD1(a,b,c,d,k,s) a += F(b,c,d) + X[k]; a = ROTL(a,s)
  75
  76 /* round 2: [abcd k s]: a = (a + G(b,c,d) + X[k] + MAGIC) <<< s */
  77 #define RD2(a,b,c,d,k,s) a += G(b,c,d) + X[k] + 0x5A827999; a = ROTL(a,s)
  78
  79 /* round 3: [abcd k s]: a = (a + H(b,c,d) + X[k] + MAGIC) <<< s */
  80 #define RD3(a,b,c,d,k,s) a += H(b,c,d) + X[k] + 0x6ED9EBA1; a = ROTL(a,s)
  81
  82 /* converts from word array to byte array, len is number of bytes */
  83 static void w2b(Uint8 *out, const Uint32 *in, Uint32 len)
  84 {
  85   Uint8 *bp; const Uint32 *wp, *wpend;
  86
  87   bp = out;
  88   wp = in;
  89   wpend = wp + (len >> 2);
  90
  91   for (; wp != wpend; ++wp, bp += 4)
  92   {
  93     bp[0] = (Uint8) ((*wp      ) & 0xFF);
  94     bp[1] = (Uint8) ((*wp >>  8) & 0xFF);
  95     bp[2] = (Uint8) ((*wp >> 16) & 0xFF);
  96     bp[3] = (Uint8) ((*wp >> 24) & 0xFF);
  97   }
  98 }
  99
 100 /* converts from byte array to word array, len is number of bytes */
 101 static void b2w(Uint32 *out, const Uint8 *in, Uint32 len)
 102 {
 103   Uint32 *wp; const Uint8 *bp, *bpend;
 104
 105   wp = out;
 106   bp = in;
 107   bpend = in + len;
 108
 109   for (; bp != bpend; bp += 4, ++wp)
 110   {
 111     *wp = (Uint32) (bp[0]      ) |
 112           (Uint32) (bp[1] <<  8) |
 113           (Uint32) (bp[2] << 16) |
 114           (Uint32) (bp[3] << 24);
 115   }
 116 }
 117
 118 /* update state: data is 64 bytes in length */
 119 static void md4step(Uint32 state[4], const Uint8 *data)
 120 {
 121   Uint32 A, B, C, D, X[16];
 122
 123   b2w(X, data, 64);
 124
 125   A = state[0];
 126   B = state[1];
 127   C = state[2];
 128   D = state[3];
 129
 130   RD1(A,B,C,D, 0,3); RD1(D,A,B,C, 1,7); RD1(C,D,A,B, 2,11); RD1(B,C,D,A, 3,19);
 131   RD1(A,B,C,D, 4,3); RD1(D,A,B,C, 5,7); RD1(C,D,A,B, 6,11); RD1(B,C,D,A, 7,19);
 132   RD1(A,B,C,D, 8,3); RD1(D,A,B,C, 9,7); RD1(C,D,A,B,10,11); RD1(B,C,D,A,11,19);
 133   RD1(A,B,C,D,12,3); RD1(D,A,B,C,13,7); RD1(C,D,A,B,14,11); RD1(B,C,D,A,15,19);
 134
 135   RD2(A,B,C,D, 0,3); RD2(D,A,B,C, 4,5); RD2(C,D,A,B, 8, 9); RD2(B,C,D,A,12,13);
 136   RD2(A,B,C,D, 1,3); RD2(D,A,B,C, 5,5); RD2(C,D,A,B, 9, 9); RD2(B,C,D,A,13,13);
 137   RD2(A,B,C,D, 2,3); RD2(D,A,B,C, 6,5); RD2(C,D,A,B,10, 9); RD2(B,C,D,A,14,13);
 138   RD2(A,B,C,D, 3,3); RD2(D,A,B,C, 7,5); RD2(C,D,A,B,11, 9); RD2(B,C,D,A,15,13);
 139
 140   RD3(A,B,C,D, 0,3); RD3(D,A,B,C, 8,9); RD3(C,D,A,B, 4,11); RD3(B,C,D,A,12,15);
 141   RD3(A,B,C,D, 2,3); RD3(D,A,B,C,10,9); RD3(C,D,A,B, 6,11); RD3(B,C,D,A,14,15);
 142   RD3(A,B,C,D, 1,3); RD3(D,A,B,C, 9,9); RD3(C,D,A,B, 5,11); RD3(B,C,D,A,13,15);
 143   RD3(A,B,C,D, 3,3); RD3(D,A,B,C,11,9); RD3(C,D,A,B, 7,11); RD3(B,C,D,A,15,15);
 144
 145   state[0] += A;
 146   state[1] += B;
 147   state[2] += C;
 148   state[3] += D;
 149 }
 150
 151 void md4sum(const Uint8 *input, Uint32 inputLen, Uint8 *result)
 152 {
 153   Uint8 final[128];
 154   Uint32 i, n, m, state[4];
 155
 156   /* magic initial states */
 157   state[0] = 0x67452301;
 158   state[1] = 0xEFCDAB89;
 159   state[2] = 0x98BADCFE;
 160   state[3] = 0x10325476;
 161
 162   /* compute number of complete 64-byte segments contained in input */
 163   m = inputLen >> 6;
 164
 165   /* digest first m segments */
 166   for (i=0; i<m; ++i)
 167     md4step(state, (input + (i << 6)));
 168
 169   /* build final buffer */
 170   n = inputLen % 64;
 171   memcpy(final, input + (m << 6), n);
 172   final[n] = 0x80;
 173   memset(final + n + 1, 0, 120 - (n + 1));
 174
 175   inputLen = inputLen << 3;
 176   w2b(final + (n >= 56 ? 120 : 56), &inputLen, 4);
 177
 178   md4step(state, final);
 179   if (n >= 56)
 180     md4step(state, final + 64);
 181
 182   /* copy state to result */
 183   w2b(result, state, 16);
 184 }