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