1 /* crypto/sha/sha_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 routines 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 <sys/types.h> 60 61 #include <stdio.h> 62 #include <string.h> 63 64 #if 0 65 #include <machine/ansi.h> /* we use the __ variants of bit-sized types */ 66 #endif 67 #include <machine/endian.h> 68 69 #define SHA_0 70 #undef SHA_1 71 #include "sha.h" 72 #include "sha_locl.h" 73 74 char *SHA_version="SHA part of SSLeay 0.9.0b 11-Oct-1998"; 75 76 /* Implemented from SHA-0 document - The Secure Hash Algorithm 77 */ 78 79 #define INIT_DATA_h0 (unsigned long)0x67452301L 80 #define INIT_DATA_h1 (unsigned long)0xefcdab89L 81 #define INIT_DATA_h2 (unsigned long)0x98badcfeL 82 #define INIT_DATA_h3 (unsigned long)0x10325476L 83 #define INIT_DATA_h4 (unsigned long)0xc3d2e1f0L 84 85 #define K_00_19 0x5a827999L 86 #define K_20_39 0x6ed9eba1L 87 #define K_40_59 0x8f1bbcdcL 88 #define K_60_79 0xca62c1d6L 89 90 #ifndef NOPROTO 91 void sha_block(SHA_CTX *c, const u_int32_t *p, int num); 92 #else 93 void sha_block(); 94 #endif 95 96 #define M_c2nl c2nl 97 #define M_p_c2nl p_c2nl 98 #define M_c2nl_p c2nl_p 99 #define M_p_c2nl_p p_c2nl_p 100 #define M_nl2c nl2c 101 102 void SHA_Init(SHA_CTX *c) 103 { 104 c->h0=INIT_DATA_h0; 105 c->h1=INIT_DATA_h1; 106 c->h2=INIT_DATA_h2; 107 c->h3=INIT_DATA_h3; 108 c->h4=INIT_DATA_h4; 109 c->Nl=0; 110 c->Nh=0; 111 c->num=0; 112 } 113 114 void SHA_Update(SHA_CTX *c, const void *in, size_t len) 115 { 116 u_int32_t *p; 117 int ew,ec,sw,sc; 118 u_int32_t l; 119 const unsigned char *data = in; 120 121 if (len == 0) return; 122 123 l=(c->Nl+(len<<3))&0xffffffffL; 124 if (l < c->Nl) /* overflow */ 125 c->Nh++; 126 c->Nh+=(len>>29); 127 c->Nl=l; 128 129 if (c->num != 0) 130 { 131 p=c->data; 132 sw=c->num>>2; 133 sc=c->num&0x03; 134 135 if ((c->num+len) >= SHA_CBLOCK) 136 { 137 l= p[sw]; 138 M_p_c2nl(data,l,sc); 139 p[sw++]=l; 140 for (; sw<SHA_LBLOCK; sw++) 141 { 142 M_c2nl(data,l); 143 p[sw]=l; 144 } 145 len-=(SHA_CBLOCK-c->num); 146 147 sha_block(c,p,64); 148 c->num=0; 149 /* drop through and do the rest */ 150 } 151 else 152 { 153 c->num+=(int)len; 154 if ((sc+len) < 4) /* ugly, add char's to a word */ 155 { 156 l= p[sw]; 157 M_p_c2nl_p(data,l,sc,len); 158 p[sw]=l; 159 } 160 else 161 { 162 ew=(c->num>>2); 163 ec=(c->num&0x03); 164 l= p[sw]; 165 M_p_c2nl(data,l,sc); 166 p[sw++]=l; 167 for (; sw < ew; sw++) 168 { M_c2nl(data,l); p[sw]=l; } 169 if (ec) 170 { 171 M_c2nl_p(data,l,ec); 172 p[sw]=l; 173 } 174 } 175 return; 176 } 177 } 178 /* We can only do the following code for assember, the reason 179 * being that the sha_block 'C' version changes the values 180 * in the 'data' array. The assember code avoids this and 181 * copies it to a local array. I should be able to do this for 182 * the C version as well.... 183 */ 184 #if 1 185 #if BYTE_ORDER == BIG_ENDIAN || defined(SHA_ASM) 186 if ((((unsigned int)data)%sizeof(u_int32_t)) == 0) 187 { 188 sw=len/SHA_CBLOCK; 189 if (sw) 190 { 191 sw*=SHA_CBLOCK; 192 sha_block(c,(u_int32_t *)data,sw); 193 data+=sw; 194 len-=sw; 195 } 196 } 197 #endif 198 #endif 199 /* we now can process the input data in blocks of SHA_CBLOCK 200 * chars and save the leftovers to c->data. */ 201 p=c->data; 202 while (len >= SHA_CBLOCK) 203 { 204 #if BYTE_ORDER == BIG_ENDIAN || BYTE_ORDER == LITTLE_ENDIAN 205 if (p != (u_int32_t *)data) 206 memcpy(p,data,SHA_CBLOCK); 207 data+=SHA_CBLOCK; 208 # if BYTE_ORDER == LITTLE_ENDIAN 209 # ifndef SHA_ASM /* Will not happen */ 210 for (sw=(SHA_LBLOCK/4); sw; sw--) 211 { 212 Endian_Reverse32(p[0]); 213 Endian_Reverse32(p[1]); 214 Endian_Reverse32(p[2]); 215 Endian_Reverse32(p[3]); 216 p+=4; 217 } 218 p=c->data; 219 # endif 220 # endif 221 #else 222 for (sw=(SHA_BLOCK/4); sw; sw--) 223 { 224 M_c2nl(data,l); *(p++)=l; 225 M_c2nl(data,l); *(p++)=l; 226 M_c2nl(data,l); *(p++)=l; 227 M_c2nl(data,l); *(p++)=l; 228 } 229 p=c->data; 230 #endif 231 sha_block(c,p,64); 232 len-=SHA_CBLOCK; 233 } 234 ec=(int)len; 235 c->num=ec; 236 ew=(ec>>2); 237 ec&=0x03; 238 239 for (sw=0; sw < ew; sw++) 240 { M_c2nl(data,l); p[sw]=l; } 241 M_c2nl_p(data,l,ec); 242 p[sw]=l; 243 } 244 245 void SHA_Transform(SHA_CTX *c, unsigned char *b) 246 { 247 u_int32_t p[16]; 248 #if BYTE_ORDER == LITTLE_ENDIAN 249 u_int32_t *q; 250 int i; 251 #endif 252 253 #if BYTE_ORDER == BIG_ENDIAN || BYTE_ORDER == LITTLE_ENDIAN 254 memcpy(p,b,64); 255 #if BYTE_ORDER == LITTLE_ENDIAN 256 q=p; 257 for (i=(SHA_LBLOCK/4); i; i--) 258 { 259 Endian_Reverse32(q[0]); 260 Endian_Reverse32(q[1]); 261 Endian_Reverse32(q[2]); 262 Endian_Reverse32(q[3]); 263 q+=4; 264 } 265 #endif 266 #else 267 q=p; 268 for (i=(SHA_LBLOCK/4); i; i--) 269 { 270 u_int32_t l; 271 c2nl(b,l); *(q++)=l; 272 c2nl(b,l); *(q++)=l; 273 c2nl(b,l); *(q++)=l; 274 c2nl(b,l); *(q++)=l; 275 } 276 #endif 277 sha_block(c,p,64); 278 } 279 280 void sha_block(SHA_CTX *c, const u_int32_t *W, int num) 281 { 282 u_int32_t A,B,C,D,E,T; 283 u_int32_t X[16]; 284 285 A=c->h0; 286 B=c->h1; 287 C=c->h2; 288 D=c->h3; 289 E=c->h4; 290 291 for (;;) 292 { 293 BODY_00_15( 0,A,B,C,D,E,T,W); 294 BODY_00_15( 1,T,A,B,C,D,E,W); 295 BODY_00_15( 2,E,T,A,B,C,D,W); 296 BODY_00_15( 3,D,E,T,A,B,C,W); 297 BODY_00_15( 4,C,D,E,T,A,B,W); 298 BODY_00_15( 5,B,C,D,E,T,A,W); 299 BODY_00_15( 6,A,B,C,D,E,T,W); 300 BODY_00_15( 7,T,A,B,C,D,E,W); 301 BODY_00_15( 8,E,T,A,B,C,D,W); 302 BODY_00_15( 9,D,E,T,A,B,C,W); 303 BODY_00_15(10,C,D,E,T,A,B,W); 304 BODY_00_15(11,B,C,D,E,T,A,W); 305 BODY_00_15(12,A,B,C,D,E,T,W); 306 BODY_00_15(13,T,A,B,C,D,E,W); 307 BODY_00_15(14,E,T,A,B,C,D,W); 308 BODY_00_15(15,D,E,T,A,B,C,W); 309 BODY_16_19(16,C,D,E,T,A,B,W,W,W,W); 310 BODY_16_19(17,B,C,D,E,T,A,W,W,W,W); 311 BODY_16_19(18,A,B,C,D,E,T,W,W,W,W); 312 BODY_16_19(19,T,A,B,C,D,E,W,W,W,X); 313 314 BODY_20_31(20,E,T,A,B,C,D,W,W,W,X); 315 BODY_20_31(21,D,E,T,A,B,C,W,W,W,X); 316 BODY_20_31(22,C,D,E,T,A,B,W,W,W,X); 317 BODY_20_31(23,B,C,D,E,T,A,W,W,W,X); 318 BODY_20_31(24,A,B,C,D,E,T,W,W,X,X); 319 BODY_20_31(25,T,A,B,C,D,E,W,W,X,X); 320 BODY_20_31(26,E,T,A,B,C,D,W,W,X,X); 321 BODY_20_31(27,D,E,T,A,B,C,W,W,X,X); 322 BODY_20_31(28,C,D,E,T,A,B,W,W,X,X); 323 BODY_20_31(29,B,C,D,E,T,A,W,W,X,X); 324 BODY_20_31(30,A,B,C,D,E,T,W,X,X,X); 325 BODY_20_31(31,T,A,B,C,D,E,W,X,X,X); 326 BODY_32_39(32,E,T,A,B,C,D,X); 327 BODY_32_39(33,D,E,T,A,B,C,X); 328 BODY_32_39(34,C,D,E,T,A,B,X); 329 BODY_32_39(35,B,C,D,E,T,A,X); 330 BODY_32_39(36,A,B,C,D,E,T,X); 331 BODY_32_39(37,T,A,B,C,D,E,X); 332 BODY_32_39(38,E,T,A,B,C,D,X); 333 BODY_32_39(39,D,E,T,A,B,C,X); 334 335 BODY_40_59(40,C,D,E,T,A,B,X); 336 BODY_40_59(41,B,C,D,E,T,A,X); 337 BODY_40_59(42,A,B,C,D,E,T,X); 338 BODY_40_59(43,T,A,B,C,D,E,X); 339 BODY_40_59(44,E,T,A,B,C,D,X); 340 BODY_40_59(45,D,E,T,A,B,C,X); 341 BODY_40_59(46,C,D,E,T,A,B,X); 342 BODY_40_59(47,B,C,D,E,T,A,X); 343 BODY_40_59(48,A,B,C,D,E,T,X); 344 BODY_40_59(49,T,A,B,C,D,E,X); 345 BODY_40_59(50,E,T,A,B,C,D,X); 346 BODY_40_59(51,D,E,T,A,B,C,X); 347 BODY_40_59(52,C,D,E,T,A,B,X); 348 BODY_40_59(53,B,C,D,E,T,A,X); 349 BODY_40_59(54,A,B,C,D,E,T,X); 350 BODY_40_59(55,T,A,B,C,D,E,X); 351 BODY_40_59(56,E,T,A,B,C,D,X); 352 BODY_40_59(57,D,E,T,A,B,C,X); 353 BODY_40_59(58,C,D,E,T,A,B,X); 354 BODY_40_59(59,B,C,D,E,T,A,X); 355 356 BODY_60_79(60,A,B,C,D,E,T,X); 357 BODY_60_79(61,T,A,B,C,D,E,X); 358 BODY_60_79(62,E,T,A,B,C,D,X); 359 BODY_60_79(63,D,E,T,A,B,C,X); 360 BODY_60_79(64,C,D,E,T,A,B,X); 361 BODY_60_79(65,B,C,D,E,T,A,X); 362 BODY_60_79(66,A,B,C,D,E,T,X); 363 BODY_60_79(67,T,A,B,C,D,E,X); 364 BODY_60_79(68,E,T,A,B,C,D,X); 365 BODY_60_79(69,D,E,T,A,B,C,X); 366 BODY_60_79(70,C,D,E,T,A,B,X); 367 BODY_60_79(71,B,C,D,E,T,A,X); 368 BODY_60_79(72,A,B,C,D,E,T,X); 369 BODY_60_79(73,T,A,B,C,D,E,X); 370 BODY_60_79(74,E,T,A,B,C,D,X); 371 BODY_60_79(75,D,E,T,A,B,C,X); 372 BODY_60_79(76,C,D,E,T,A,B,X); 373 BODY_60_79(77,B,C,D,E,T,A,X); 374 BODY_60_79(78,A,B,C,D,E,T,X); 375 BODY_60_79(79,T,A,B,C,D,E,X); 376 377 c->h0=(c->h0+E)&0xffffffffL; 378 c->h1=(c->h1+T)&0xffffffffL; 379 c->h2=(c->h2+A)&0xffffffffL; 380 c->h3=(c->h3+B)&0xffffffffL; 381 c->h4=(c->h4+C)&0xffffffffL; 382 383 num-=64; 384 if (num <= 0) break; 385 386 A=c->h0; 387 B=c->h1; 388 C=c->h2; 389 D=c->h3; 390 E=c->h4; 391 392 W+=16; 393 } 394 } 395 396 void SHA_Final(unsigned char *md, SHA_CTX *c) 397 { 398 int i,j; 399 u_int32_t l; 400 u_int32_t *p; 401 static unsigned char end[4]={0x80,0x00,0x00,0x00}; 402 unsigned char *cp=end; 403 404 /* c->num should definitly have room for at least one more byte. */ 405 p=c->data; 406 j=c->num; 407 i=j>>2; 408 #ifdef PURIFY 409 if ((j&0x03) == 0) p[i]=0; 410 #endif 411 l=p[i]; 412 M_p_c2nl(cp,l,j&0x03); 413 p[i]=l; 414 i++; 415 /* i is the next 'undefined word' */ 416 if (c->num >= SHA_LAST_BLOCK) 417 { 418 for (; i<SHA_LBLOCK; i++) 419 p[i]=0; 420 sha_block(c,p,64); 421 i=0; 422 } 423 for (; i<(SHA_LBLOCK-2); i++) 424 p[i]=0; 425 p[SHA_LBLOCK-2]=c->Nh; 426 p[SHA_LBLOCK-1]=c->Nl; 427 sha_block(c,p,64); 428 cp=md; 429 l=c->h0; nl2c(l,cp); 430 l=c->h1; nl2c(l,cp); 431 l=c->h2; nl2c(l,cp); 432 l=c->h3; nl2c(l,cp); 433 l=c->h4; nl2c(l,cp); 434 435 /* Clear the context state */ 436 explicit_bzero(&c, sizeof(c)); 437 } 438 439