| 1 |
/* crypto/md5/md5_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 "md5_locl.h" |
| 61 |
|
| 62 |
/* Implemented from RFC1321 The MD5 Message-Digest Algorithm |
| 63 |
*/ |
| 64 |
|
| 65 |
#define INIT_DATA_A (unsigned long)0x67452301L |
| 66 |
#define INIT_DATA_B (unsigned long)0xefcdab89L |
| 67 |
#define INIT_DATA_C (unsigned long)0x98badcfeL |
| 68 |
#define INIT_DATA_D (unsigned long)0x10325476L |
| 69 |
|
| 70 |
void MD5_Init(MD5_CTX *c) |
| 71 |
{ |
| 72 |
c->A=INIT_DATA_A; |
| 73 |
c->B=INIT_DATA_B; |
| 74 |
c->C=INIT_DATA_C; |
| 75 |
c->D=INIT_DATA_D; |
| 76 |
c->Nl=0; |
| 77 |
c->Nh=0; |
| 78 |
c->num=0; |
| 79 |
} |
| 80 |
|
| 81 |
#ifndef md5_block_host_order |
| 82 |
void md5_block_host_order (MD5_CTX *c, const void *data, int num) |
| 83 |
{ |
| 84 |
const MD5_LONG *X=data; |
| 85 |
register unsigned long A,B,C,D; |
| 86 |
/* |
| 87 |
* In case you wonder why A-D are declared as long and not |
| 88 |
* as MD5_LONG. Doing so results in slight performance |
| 89 |
* boost on LP64 architectures. The catch is we don't |
| 90 |
* really care if 32 MSBs of a 64-bit register get polluted |
| 91 |
* with eventual overflows as we *save* only 32 LSBs in |
| 92 |
* *either* case. Now declaring 'em long excuses the compiler |
| 93 |
* from keeping 32 MSBs zeroed resulting in 13% performance |
| 94 |
* improvement under SPARC Solaris7/64 and 5% under AlphaLinux. |
| 95 |
* Well, to be honest it should say that this *prevents* |
| 96 |
* performance degradation. |
| 97 |
* |
| 98 |
* <appro@fy.chalmers.se> |
| 99 |
*/ |
| 100 |
|
| 101 |
A=c->A; |
| 102 |
B=c->B; |
| 103 |
C=c->C; |
| 104 |
D=c->D; |
| 105 |
|
| 106 |
for (;num--;X+=HASH_LBLOCK) |
| 107 |
{ |
| 108 |
/* Round 0 */ |
| 109 |
R0(A,B,C,D,X[ 0], 7,0xd76aa478L); |
| 110 |
R0(D,A,B,C,X[ 1],12,0xe8c7b756L); |
| 111 |
R0(C,D,A,B,X[ 2],17,0x242070dbL); |
| 112 |
R0(B,C,D,A,X[ 3],22,0xc1bdceeeL); |
| 113 |
R0(A,B,C,D,X[ 4], 7,0xf57c0fafL); |
| 114 |
R0(D,A,B,C,X[ 5],12,0x4787c62aL); |
| 115 |
R0(C,D,A,B,X[ 6],17,0xa8304613L); |
| 116 |
R0(B,C,D,A,X[ 7],22,0xfd469501L); |
| 117 |
R0(A,B,C,D,X[ 8], 7,0x698098d8L); |
| 118 |
R0(D,A,B,C,X[ 9],12,0x8b44f7afL); |
| 119 |
R0(C,D,A,B,X[10],17,0xffff5bb1L); |
| 120 |
R0(B,C,D,A,X[11],22,0x895cd7beL); |
| 121 |
R0(A,B,C,D,X[12], 7,0x6b901122L); |
| 122 |
R0(D,A,B,C,X[13],12,0xfd987193L); |
| 123 |
R0(C,D,A,B,X[14],17,0xa679438eL); |
| 124 |
R0(B,C,D,A,X[15],22,0x49b40821L); |
| 125 |
/* Round 1 */ |
| 126 |
R1(A,B,C,D,X[ 1], 5,0xf61e2562L); |
| 127 |
R1(D,A,B,C,X[ 6], 9,0xc040b340L); |
| 128 |
R1(C,D,A,B,X[11],14,0x265e5a51L); |
| 129 |
R1(B,C,D,A,X[ 0],20,0xe9b6c7aaL); |
| 130 |
R1(A,B,C,D,X[ 5], 5,0xd62f105dL); |
| 131 |
R1(D,A,B,C,X[10], 9,0x02441453L); |
| 132 |
R1(C,D,A,B,X[15],14,0xd8a1e681L); |
| 133 |
R1(B,C,D,A,X[ 4],20,0xe7d3fbc8L); |
| 134 |
R1(A,B,C,D,X[ 9], 5,0x21e1cde6L); |
| 135 |
R1(D,A,B,C,X[14], 9,0xc33707d6L); |
| 136 |
R1(C,D,A,B,X[ 3],14,0xf4d50d87L); |
| 137 |
R1(B,C,D,A,X[ 8],20,0x455a14edL); |
| 138 |
R1(A,B,C,D,X[13], 5,0xa9e3e905L); |
| 139 |
R1(D,A,B,C,X[ 2], 9,0xfcefa3f8L); |
| 140 |
R1(C,D,A,B,X[ 7],14,0x676f02d9L); |
| 141 |
R1(B,C,D,A,X[12],20,0x8d2a4c8aL); |
| 142 |
/* Round 2 */ |
| 143 |
R2(A,B,C,D,X[ 5], 4,0xfffa3942L); |
| 144 |
R2(D,A,B,C,X[ 8],11,0x8771f681L); |
| 145 |
R2(C,D,A,B,X[11],16,0x6d9d6122L); |
| 146 |
R2(B,C,D,A,X[14],23,0xfde5380cL); |
| 147 |
R2(A,B,C,D,X[ 1], 4,0xa4beea44L); |
| 148 |
R2(D,A,B,C,X[ 4],11,0x4bdecfa9L); |
| 149 |
R2(C,D,A,B,X[ 7],16,0xf6bb4b60L); |
| 150 |
R2(B,C,D,A,X[10],23,0xbebfbc70L); |
| 151 |
R2(A,B,C,D,X[13], 4,0x289b7ec6L); |
| 152 |
R2(D,A,B,C,X[ 0],11,0xeaa127faL); |
| 153 |
R2(C,D,A,B,X[ 3],16,0xd4ef3085L); |
| 154 |
R2(B,C,D,A,X[ 6],23,0x04881d05L); |
| 155 |
R2(A,B,C,D,X[ 9], 4,0xd9d4d039L); |
| 156 |
R2(D,A,B,C,X[12],11,0xe6db99e5L); |
| 157 |
R2(C,D,A,B,X[15],16,0x1fa27cf8L); |
| 158 |
R2(B,C,D,A,X[ 2],23,0xc4ac5665L); |
| 159 |
/* Round 3 */ |
| 160 |
R3(A,B,C,D,X[ 0], 6,0xf4292244L); |
| 161 |
R3(D,A,B,C,X[ 7],10,0x432aff97L); |
| 162 |
R3(C,D,A,B,X[14],15,0xab9423a7L); |
| 163 |
R3(B,C,D,A,X[ 5],21,0xfc93a039L); |
| 164 |
R3(A,B,C,D,X[12], 6,0x655b59c3L); |
| 165 |
R3(D,A,B,C,X[ 3],10,0x8f0ccc92L); |
| 166 |
R3(C,D,A,B,X[10],15,0xffeff47dL); |
| 167 |
R3(B,C,D,A,X[ 1],21,0x85845dd1L); |
| 168 |
R3(A,B,C,D,X[ 8], 6,0x6fa87e4fL); |
| 169 |
R3(D,A,B,C,X[15],10,0xfe2ce6e0L); |
| 170 |
R3(C,D,A,B,X[ 6],15,0xa3014314L); |
| 171 |
R3(B,C,D,A,X[13],21,0x4e0811a1L); |
| 172 |
R3(A,B,C,D,X[ 4], 6,0xf7537e82L); |
| 173 |
R3(D,A,B,C,X[11],10,0xbd3af235L); |
| 174 |
R3(C,D,A,B,X[ 2],15,0x2ad7d2bbL); |
| 175 |
R3(B,C,D,A,X[ 9],21,0xeb86d391L); |
| 176 |
|
| 177 |
A = c->A += A; |
| 178 |
B = c->B += B; |
| 179 |
C = c->C += C; |
| 180 |
D = c->D += D; |
| 181 |
} |
| 182 |
} |
| 183 |
#endif |
| 184 |
|
| 185 |
#ifndef md5_block_data_order |
| 186 |
#ifdef X |
| 187 |
#undef X |
| 188 |
#endif |
| 189 |
void md5_block_data_order (MD5_CTX *c, const void *data_, int num) |
| 190 |
{ |
| 191 |
const unsigned char *data=data_; |
| 192 |
register unsigned long A,B,C,D,l; |
| 193 |
/* |
| 194 |
* In case you wonder why A-D are declared as long and not |
| 195 |
* as MD5_LONG. Doing so results in slight performance |
| 196 |
* boost on LP64 architectures. The catch is we don't |
| 197 |
* really care if 32 MSBs of a 64-bit register get polluted |
| 198 |
* with eventual overflows as we *save* only 32 LSBs in |
| 199 |
* *either* case. Now declaring 'em long excuses the compiler |
| 200 |
* from keeping 32 MSBs zeroed resulting in 13% performance |
| 201 |
* improvement under SPARC Solaris7/64 and 5% under AlphaLinux. |
| 202 |
* Well, to be honest it should say that this *prevents* |
| 203 |
* performance degradation. |
| 204 |
* |
| 205 |
* <appro@fy.chalmers.se> |
| 206 |
*/ |
| 207 |
#ifndef MD32_XARRAY |
| 208 |
/* See comment in crypto/sha/sha_locl.h for details. */ |
| 209 |
unsigned long XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7, |
| 210 |
XX8, XX9,XX10,XX11,XX12,XX13,XX14,XX15; |
| 211 |
# define X(i) XX##i |
| 212 |
#else |
| 213 |
MD5_LONG XX[MD5_LBLOCK]; |
| 214 |
# define X(i) XX[i] |
| 215 |
#endif |
| 216 |
|
| 217 |
A=c->A; |
| 218 |
B=c->B; |
| 219 |
C=c->C; |
| 220 |
D=c->D; |
| 221 |
|
| 222 |
for (;num--;) |
| 223 |
{ |
| 224 |
HOST_c2l(data,l); X( 0)=l; HOST_c2l(data,l); X( 1)=l; |
| 225 |
/* Round 0 */ |
| 226 |
R0(A,B,C,D,X( 0), 7,0xd76aa478L); HOST_c2l(data,l); X( 2)=l; |
| 227 |
R0(D,A,B,C,X( 1),12,0xe8c7b756L); HOST_c2l(data,l); X( 3)=l; |
| 228 |
R0(C,D,A,B,X( 2),17,0x242070dbL); HOST_c2l(data,l); X( 4)=l; |
| 229 |
R0(B,C,D,A,X( 3),22,0xc1bdceeeL); HOST_c2l(data,l); X( 5)=l; |
| 230 |
R0(A,B,C,D,X( 4), 7,0xf57c0fafL); HOST_c2l(data,l); X( 6)=l; |
| 231 |
R0(D,A,B,C,X( 5),12,0x4787c62aL); HOST_c2l(data,l); X( 7)=l; |
| 232 |
R0(C,D,A,B,X( 6),17,0xa8304613L); HOST_c2l(data,l); X( 8)=l; |
| 233 |
R0(B,C,D,A,X( 7),22,0xfd469501L); HOST_c2l(data,l); X( 9)=l; |
| 234 |
R0(A,B,C,D,X( 8), 7,0x698098d8L); HOST_c2l(data,l); X(10)=l; |
| 235 |
R0(D,A,B,C,X( 9),12,0x8b44f7afL); HOST_c2l(data,l); X(11)=l; |
| 236 |
R0(C,D,A,B,X(10),17,0xffff5bb1L); HOST_c2l(data,l); X(12)=l; |
| 237 |
R0(B,C,D,A,X(11),22,0x895cd7beL); HOST_c2l(data,l); X(13)=l; |
| 238 |
R0(A,B,C,D,X(12), 7,0x6b901122L); HOST_c2l(data,l); X(14)=l; |
| 239 |
R0(D,A,B,C,X(13),12,0xfd987193L); HOST_c2l(data,l); X(15)=l; |
| 240 |
R0(C,D,A,B,X(14),17,0xa679438eL); |
| 241 |
R0(B,C,D,A,X(15),22,0x49b40821L); |
| 242 |
/* Round 1 */ |
| 243 |
R1(A,B,C,D,X( 1), 5,0xf61e2562L); |
| 244 |
R1(D,A,B,C,X( 6), 9,0xc040b340L); |
| 245 |
R1(C,D,A,B,X(11),14,0x265e5a51L); |
| 246 |
R1(B,C,D,A,X( 0),20,0xe9b6c7aaL); |
| 247 |
R1(A,B,C,D,X( 5), 5,0xd62f105dL); |
| 248 |
R1(D,A,B,C,X(10), 9,0x02441453L); |
| 249 |
R1(C,D,A,B,X(15),14,0xd8a1e681L); |
| 250 |
R1(B,C,D,A,X( 4),20,0xe7d3fbc8L); |
| 251 |
R1(A,B,C,D,X( 9), 5,0x21e1cde6L); |
| 252 |
R1(D,A,B,C,X(14), 9,0xc33707d6L); |
| 253 |
R1(C,D,A,B,X( 3),14,0xf4d50d87L); |
| 254 |
R1(B,C,D,A,X( 8),20,0x455a14edL); |
| 255 |
R1(A,B,C,D,X(13), 5,0xa9e3e905L); |
| 256 |
R1(D,A,B,C,X( 2), 9,0xfcefa3f8L); |
| 257 |
R1(C,D,A,B,X( 7),14,0x676f02d9L); |
| 258 |
R1(B,C,D,A,X(12),20,0x8d2a4c8aL); |
| 259 |
/* Round 2 */ |
| 260 |
R2(A,B,C,D,X( 5), 4,0xfffa3942L); |
| 261 |
R2(D,A,B,C,X( 8),11,0x8771f681L); |
| 262 |
R2(C,D,A,B,X(11),16,0x6d9d6122L); |
| 263 |
R2(B,C,D,A,X(14),23,0xfde5380cL); |
| 264 |
R2(A,B,C,D,X( 1), 4,0xa4beea44L); |
| 265 |
R2(D,A,B,C,X( 4),11,0x4bdecfa9L); |
| 266 |
R2(C,D,A,B,X( 7),16,0xf6bb4b60L); |
| 267 |
R2(B,C,D,A,X(10),23,0xbebfbc70L); |
| 268 |
R2(A,B,C,D,X(13), 4,0x289b7ec6L); |
| 269 |
R2(D,A,B,C,X( 0),11,0xeaa127faL); |
| 270 |
R2(C,D,A,B,X( 3),16,0xd4ef3085L); |
| 271 |
R2(B,C,D,A,X( 6),23,0x04881d05L); |
| 272 |
R2(A,B,C,D,X( 9), 4,0xd9d4d039L); |
| 273 |
R2(D,A,B,C,X(12),11,0xe6db99e5L); |
| 274 |
R2(C,D,A,B,X(15),16,0x1fa27cf8L); |
| 275 |
R2(B,C,D,A,X( 2),23,0xc4ac5665L); |
| 276 |
/* Round 3 */ |
| 277 |
R3(A,B,C,D,X( 0), 6,0xf4292244L); |
| 278 |
R3(D,A,B,C,X( 7),10,0x432aff97L); |
| 279 |
R3(C,D,A,B,X(14),15,0xab9423a7L); |
| 280 |
R3(B,C,D,A,X( 5),21,0xfc93a039L); |
| 281 |
R3(A,B,C,D,X(12), 6,0x655b59c3L); |
| 282 |
R3(D,A,B,C,X( 3),10,0x8f0ccc92L); |
| 283 |
R3(C,D,A,B,X(10),15,0xffeff47dL); |
| 284 |
R3(B,C,D,A,X( 1),21,0x85845dd1L); |
| 285 |
R3(A,B,C,D,X( 8), 6,0x6fa87e4fL); |
| 286 |
R3(D,A,B,C,X(15),10,0xfe2ce6e0L); |
| 287 |
R3(C,D,A,B,X( 6),15,0xa3014314L); |
| 288 |
R3(B,C,D,A,X(13),21,0x4e0811a1L); |
| 289 |
R3(A,B,C,D,X( 4), 6,0xf7537e82L); |
| 290 |
R3(D,A,B,C,X(11),10,0xbd3af235L); |
| 291 |
R3(C,D,A,B,X( 2),15,0x2ad7d2bbL); |
| 292 |
R3(B,C,D,A,X( 9),21,0xeb86d391L); |
| 293 |
|
| 294 |
A = c->A += A; |
| 295 |
B = c->B += B; |
| 296 |
C = c->C += C; |
| 297 |
D = c->D += D; |
| 298 |
} |
| 299 |
} |
| 300 |
#endif |
| 301 |
|
| 302 |
#ifdef undef |
| 303 |
int printit(unsigned long *l) |
| 304 |
{ |
| 305 |
int i,ii; |
| 306 |
|
| 307 |
for (i=0; i<2; i++) |
| 308 |
{ |
| 309 |
for (ii=0; ii<8; ii++) |
| 310 |
{ |
| 311 |
fprintf(stderr,"%08lx ",l[i*8+ii]); |
| 312 |
} |
| 313 |
fprintf(stderr,"\n"); |
| 314 |
} |
| 315 |
} |
| 316 |
#endif |
Parent Directory
| 
Revision Log