crypto/md4/md4_dgst.c

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