LCOV - code coverage report
Current view: directory - security/manager/ssl/src - md4.c (source / functions) Found Hit Coverage
Test: app.info Lines: 62 0 0.0 %
Date: 2012-06-02 Functions: 4 0 0.0 %

       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                 :  * "clean room" MD4 implementation (see RFC 1320)
      40                 :  */
      41                 : 
      42                 : #include <string.h>
      43                 : #include "md4.h"
      44                 : 
      45                 : typedef PRUint32 Uint32;
      46                 : typedef PRUint8 Uint8;
      47                 : 
      48                 : /* the "conditional" function */
      49                 : #define F(x,y,z) (((x) & (y)) | (~(x) & (z)))
      50                 : 
      51                 : /* the "majority" function */
      52                 : #define G(x,y,z) (((x) & (y)) | ((x) & (z)) | ((y) & (z)))
      53                 : 
      54                 : /* the "parity" function */
      55                 : #define H(x,y,z) ((x) ^ (y) ^ (z))
      56                 : 
      57                 : /* rotate n-bits to the left */
      58                 : #define ROTL(x,n) (((x) << (n)) | ((x) >> (0x20 - n)))
      59                 : 
      60                 : /* round 1: [abcd k s]: a = (a + F(b,c,d) + X[k]) <<< s */
      61                 : #define RD1(a,b,c,d,k,s) a += F(b,c,d) + X[k]; a = ROTL(a,s)
      62                 : 
      63                 : /* round 2: [abcd k s]: a = (a + G(b,c,d) + X[k] + MAGIC) <<< s */
      64                 : #define RD2(a,b,c,d,k,s) a += G(b,c,d) + X[k] + 0x5A827999; a = ROTL(a,s)
      65                 : 
      66                 : /* round 3: [abcd k s]: a = (a + H(b,c,d) + X[k] + MAGIC) <<< s */
      67                 : #define RD3(a,b,c,d,k,s) a += H(b,c,d) + X[k] + 0x6ED9EBA1; a = ROTL(a,s)
      68                 : 
      69                 : /* converts from word array to byte array, len is number of bytes */
      70               0 : static void w2b(Uint8 *out, const Uint32 *in, Uint32 len)
      71                 : {
      72                 :   Uint8 *bp; const Uint32 *wp, *wpend;
      73                 : 
      74               0 :   bp = out;
      75               0 :   wp = in;
      76               0 :   wpend = wp + (len >> 2);
      77                 : 
      78               0 :   for (; wp != wpend; ++wp, bp += 4)
      79                 :   {
      80               0 :     bp[0] = (Uint8) ((*wp      ) & 0xFF);
      81               0 :     bp[1] = (Uint8) ((*wp >>  8) & 0xFF);
      82               0 :     bp[2] = (Uint8) ((*wp >> 16) & 0xFF);
      83               0 :     bp[3] = (Uint8) ((*wp >> 24) & 0xFF);
      84                 :   }
      85               0 : }
      86                 : 
      87                 : /* converts from byte array to word array, len is number of bytes */
      88               0 : static void b2w(Uint32 *out, const Uint8 *in, Uint32 len)
      89                 : {
      90                 :   Uint32 *wp; const Uint8 *bp, *bpend;
      91                 : 
      92               0 :   wp = out;
      93               0 :   bp = in;
      94               0 :   bpend = in + len;
      95                 : 
      96               0 :   for (; bp != bpend; bp += 4, ++wp)
      97                 :   {
      98               0 :     *wp = (Uint32) (bp[0]      ) |
      99               0 :           (Uint32) (bp[1] <<  8) |
     100               0 :           (Uint32) (bp[2] << 16) |
     101               0 :           (Uint32) (bp[3] << 24);
     102                 :   }
     103               0 : }
     104                 : 
     105                 : /* update state: data is 64 bytes in length */
     106               0 : static void md4step(Uint32 state[4], const Uint8 *data)
     107                 : {
     108                 :   Uint32 A, B, C, D, X[16];
     109                 : 
     110               0 :   b2w(X, data, 64);
     111                 : 
     112               0 :   A = state[0];
     113               0 :   B = state[1];
     114               0 :   C = state[2];
     115               0 :   D = state[3];
     116                 : 
     117               0 :   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);
     118               0 :   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);
     119               0 :   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);
     120               0 :   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);
     121                 : 
     122               0 :   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); 
     123               0 :   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); 
     124               0 :   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); 
     125               0 :   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); 
     126                 : 
     127               0 :   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);
     128               0 :   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);
     129               0 :   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);
     130               0 :   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);
     131                 : 
     132               0 :   state[0] += A;
     133               0 :   state[1] += B;
     134               0 :   state[2] += C;
     135               0 :   state[3] += D;
     136               0 : }
     137                 : 
     138               0 : void md4sum(const Uint8 *input, Uint32 inputLen, Uint8 *result)
     139                 : {
     140                 :   Uint8 final[128];
     141                 :   Uint32 i, n, m, state[4];
     142                 : 
     143                 :   /* magic initial states */
     144               0 :   state[0] = 0x67452301;
     145               0 :   state[1] = 0xEFCDAB89;
     146               0 :   state[2] = 0x98BADCFE;
     147               0 :   state[3] = 0x10325476;
     148                 : 
     149                 :   /* compute number of complete 64-byte segments contained in input */
     150               0 :   m = inputLen >> 6;
     151                 : 
     152                 :   /* digest first m segments */
     153               0 :   for (i=0; i<m; ++i)
     154               0 :     md4step(state, (input + (i << 6)));
     155                 : 
     156                 :   /* build final buffer */
     157               0 :   n = inputLen % 64;
     158               0 :   memcpy(final, input + (m << 6), n);
     159               0 :   final[n] = 0x80;
     160               0 :   memset(final + n + 1, 0, 120 - (n + 1));
     161                 : 
     162               0 :   inputLen = inputLen << 3;
     163               0 :   w2b(final + (n >= 56 ? 120 : 56), &inputLen, 4);
     164                 : 
     165               0 :   md4step(state, final);
     166               0 :   if (n >= 56)
     167               0 :     md4step(state, final + 64);
     168                 : 
     169                 :   /* copy state to result */
     170               0 :   w2b(result, state, 16);
     171               0 : }

Generated by: LCOV version 1.7