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