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