root/modules/sha1.c

DEFINITIONS

1. hmac_sha1_vector
2. hmac_sha1
3. sha1_prf
4. sha1_t_prf
5. tls_prf
6. pbkdf2_sha1_f
7. pbkdf2_sha1
8. sha1_vector
9. fips186_2_prf
10. SHAPrintContext
11. SHA1Transform
12. SHA1Init
13. SHA1Update
14. SHA1Final

   1 /*
   2  * SHA1 hash implementation and interface functions
   3  * Copyright (c) 2003-2005, Jouni Malinen <j@w1.fi>
   4  *
   5  * This program is free software; you can redistribute it and/or modify
   6  * it under the terms of the GNU General Public License version 2 as
   7  * published by the Free Software Foundation.
   8  *
   9  * Alternatively, this software may be distributed under the terms of BSD
  10  * license.
  11  *
  12  * See README and COPYING for more details.
  13   * modified for CHDK by buttim@hotmail.com
  14  */
  16 #include "eyefi.h"
  18 #include <string.h>
  19 //#include <unistd.h>
  21 #define SHA1_MAC_LEN 20
  22 void sha1_vector(size_t num_elem, const u8 *addr[], const size_t *len, u8 *mac);
  24 #define MD5_MAC_LEN 16
  26 /**
  27  * hmac_sha1_vector - HMAC-SHA1 over data vector (RFC 2104)
  28  * @key: Key for HMAC operations
  29  * @key_len: Length of the key in bytes
  30  * @num_elem: Number of elements in the data vector
  31  * @addr: Pointers to the data areas
  32  * @len: Lengths of the data blocks
  33  * @mac: Buffer for the hash (20 bytes)
  34  */
  35 void hmac_sha1_vector(const u8 *key, size_t key_len, size_t num_elem,
  36                       const u8 *addr[], const size_t *len, u8 *mac)
  37 {
  38         unsigned char k_pad[64]; /* padding - key XORd with ipad/opad */
  39         unsigned char tk[20];
  40         const u8 *_addr[6];
size_t _len[6], i;
  43         if (num_elem > 5) {
  44                 /*
  45                  * Fixed limit on the number of fragments to avoid having to
  46                  * allocate memory (which could fail).
  47                  */
  48                 return;
  49         }
  51         /* if key is longer than 64 bytes reset it to key = SHA1(key) */
  52         if (key_len > 64) {
sha1_vector(1, &key, &key_len, tk);
key = tk;
key_len = 20;
  56         }
  58         /* the HMAC_SHA1 transform looks like:
  59          *
  60          * SHA1(K XOR opad, SHA1(K XOR ipad, text))
  61          *
  62          * where K is an n byte key
  63          * ipad is the byte 0x36 repeated 64 times
  64          * opad is the byte 0x5c repeated 64 times
  65          * and text is the data being protected */
  67         /* start out by storing key in ipad */
memset(k_pad, 0, sizeof(k_pad));
memcpy(k_pad, key, key_len);
  70         /* XOR key with ipad values */
  71         for (i = 0; i < 64; i++)
k_pad[i] ^= 0x36;
  74         /* perform inner SHA1 */
_addr[0] = k_pad;
_len[0] = 64;
  77         for (i = 0; i < num_elem; i++) {
_addr[i + 1] = addr[i];
_len[i + 1] = len[i];
  80         }
sha1_vector(1 + num_elem, _addr, _len, mac);
memset(k_pad, 0, sizeof(k_pad));
memcpy(k_pad, key, key_len);
  85         /* XOR key with opad values */
  86         for (i = 0; i < 64; i++)
k_pad[i] ^= 0x5c;
  89         /* perform outer SHA1 */
_addr[0] = k_pad;
_len[0] = 64;
_addr[1] = mac;
_len[1] = SHA1_MAC_LEN;
sha1_vector(2, _addr, _len, mac);
  95 }
  98 /**
  99  * hmac_sha1 - HMAC-SHA1 over data buffer (RFC 2104)
 100  * @key: Key for HMAC operations
 101  * @key_len: Length of the key in bytes
 102  * @data: Pointers to the data area
 103  * @data_len: Length of the data area
 104  * @mac: Buffer for the hash (20 bytes)
 105  */
 106 void hmac_sha1(const u8 *key, size_t key_len, const u8 *data, size_t data_len,
u8 *mac)
 108 {
hmac_sha1_vector(key, key_len, 1, &data, &data_len, mac);
 110 }
 113 /**
 114  * sha1_prf - SHA1-based Pseudo-Random Function (PRF) (IEEE 802.11i, 8.5.1.1)
 115  * @key: Key for PRF
 116  * @key_len: Length of the key in bytes
 117  * @label: A unique label for each purpose of the PRF
 118  * @data: Extra data to bind into the key
 119  * @data_len: Length of the data
 120  * @buf: Buffer for the generated pseudo-random key
 121  * @buf_len: Number of bytes of key to generate
 122  *
 123  * This function is used to derive new, cryptographically separate keys from a
 124  * given key (e.g., PMK in IEEE 802.11i).
 125  */
 126 void sha1_prf(const u8 *key, size_t key_len, const char *label,
 127               const u8 *data, size_t data_len, u8 *buf, size_t buf_len)
 128 {
u8 zero = 0, counter = 0;
size_t pos, plen;
u8 hash[SHA1_MAC_LEN];
size_t label_len = strlen(label);
 133         const unsigned char *addr[4];
size_t len[4];
addr[0] = (u8 *) label;
len[0] = label_len;
addr[1] = &zero;
len[1] = 1;
addr[2] = data;
len[2] = data_len;
addr[3] = &counter;
len[3] = 1;
pos = 0;
 146         while (pos < buf_len) {
plen = buf_len - pos;
 148                 if (plen >= SHA1_MAC_LEN) {
hmac_sha1_vector(key, key_len, 4, addr, len,
 150                                          &buf[pos]);
pos += SHA1_MAC_LEN;
 152                 } else {
hmac_sha1_vector(key, key_len, 4, addr, len,
hash);
memcpy(&buf[pos], hash, plen);
 156                         break;
 157                 }
counter++;
 159         }
 160 }
 163 /**
 164  * sha1_t_prf - EAP-FAST Pseudo-Random Function (T-PRF)
 165  * @key: Key for PRF
 166  * @key_len: Length of the key in bytes
 167  * @label: A unique label for each purpose of the PRF
 168  * @seed: Seed value to bind into the key
 169  * @seed_len: Length of the seed
 170  * @buf: Buffer for the generated pseudo-random key
 171  * @buf_len: Number of bytes of key to generate
 172  *
 173  * This function is used to derive new, cryptographically separate keys from a
 174  * given key for EAP-FAST. T-PRF is defined in
 175  * draft-cam-winget-eap-fast-02.txt, Appendix B.
 176  */
 177 void sha1_t_prf(const u8 *key, size_t key_len, const char *label,
 178                 const u8 *seed, size_t seed_len, u8 *buf, size_t buf_len)
 179 {
 180         unsigned char counter = 0;
size_t pos, plen;
u8 hash[SHA1_MAC_LEN];
size_t label_len = strlen(label);
u8 output_len[2];
 185         const unsigned char *addr[5];
size_t len[5];
addr[0] = hash;
len[0] = 0;
addr[1] = (unsigned char *) label;
len[1] = label_len + 1;
addr[2] = seed;
len[2] = seed_len;
addr[3] = output_len;
len[3] = 2;
addr[4] = &counter;
len[4] = 1;
output_len[0] = (buf_len >> 8) & 0xff;
output_len[1] = buf_len & 0xff;
pos = 0;
 202         while (pos < buf_len) {
counter++;
plen = buf_len - pos;
hmac_sha1_vector(key, key_len, 5, addr, len, hash);
 206                 if (plen >= SHA1_MAC_LEN) {
memcpy(&buf[pos], hash, SHA1_MAC_LEN);
pos += SHA1_MAC_LEN;
 209                 } else {
memcpy(&buf[pos], hash, plen);
 211                         break;
 212                 }
len[0] = SHA1_MAC_LEN;
 214         }
 215 }
 218 /**
 219  * tls_prf - Pseudo-Random Function for TLS (TLS-PRF, RFC 2246)
 220  * @secret: Key for PRF
 221  * @secret_len: Length of the key in bytes
 222  * @label: A unique label for each purpose of the PRF
 223  * @seed: Seed value to bind into the key
 224  * @seed_len: Length of the seed
 225  * @out: Buffer for the generated pseudo-random key
 226  * @outlen: Number of bytes of key to generate
 227  * Returns: 0 on success, -1 on failure.
 228  *
 229  * This function is used to derive new, cryptographically separate keys from a
 230  * given key in TLS. This PRF is defined in RFC 2246, Chapter 5.
 231  */
 232 int tls_prf(const u8 *secret, size_t secret_len, const char *label,
 233             const u8 *seed, size_t seed_len, u8 *out, size_t outlen)
 234 {
size_t L_S1, L_S2, i;
 236         const u8 *S1, *S2;
u8 A_MD5[MD5_MAC_LEN], A_SHA1[SHA1_MAC_LEN];
u8 P_MD5[MD5_MAC_LEN], P_SHA1[SHA1_MAC_LEN];
 239         int MD5_pos, SHA1_pos;
 240         const u8 *MD5_addr[3];
size_t MD5_len[3];
 242         const unsigned char *SHA1_addr[3];
size_t SHA1_len[3];
 245         if (secret_len & 1)
 246                 return -1;
MD5_addr[0] = A_MD5;
MD5_len[0] = MD5_MAC_LEN;
MD5_addr[1] = (unsigned char *) label;
MD5_len[1] = strlen(label);
MD5_addr[2] = seed;
MD5_len[2] = seed_len;
SHA1_addr[0] = A_SHA1;
SHA1_len[0] = SHA1_MAC_LEN;
SHA1_addr[1] = (unsigned char *) label;
SHA1_len[1] = strlen(label);
SHA1_addr[2] = seed;
SHA1_len[2] = seed_len;
 262         /* RFC 2246, Chapter 5
 263          * A(0) = seed, A(i) = HMAC(secret, A(i-1))
 264          * P_hash = HMAC(secret, A(1) + seed) + HMAC(secret, A(2) + seed) + ..
 265          * PRF = P_MD5(S1, label + seed) XOR P_SHA-1(S2, label + seed)
 266          */
L_S1 = L_S2 = (secret_len + 1) / 2;
S1 = secret;
S2 = secret + L_S1;
hmac_md5_vector(S1, L_S1, 2, &MD5_addr[1], &MD5_len[1], A_MD5);
hmac_sha1_vector(S2, L_S2, 2, &SHA1_addr[1], &SHA1_len[1], A_SHA1);
MD5_pos = MD5_MAC_LEN;
SHA1_pos = SHA1_MAC_LEN;
 277         for (i = 0; i < outlen; i++) {
 278                 if (MD5_pos == MD5_MAC_LEN) {
hmac_md5_vector(S1, L_S1, 3, MD5_addr, MD5_len, P_MD5);
MD5_pos = 0;
hmac_md5(S1, L_S1, A_MD5, MD5_MAC_LEN, A_MD5);
 282                 }
 283                 if (SHA1_pos == SHA1_MAC_LEN) {
hmac_sha1_vector(S2, L_S2, 3, SHA1_addr, SHA1_len,
P_SHA1);
SHA1_pos = 0;
hmac_sha1(S2, L_S2, A_SHA1, SHA1_MAC_LEN, A_SHA1);
 288                 }
out[i] = P_MD5[MD5_pos] ^ P_SHA1[SHA1_pos];
MD5_pos++;
SHA1_pos++;
 294         }
 296         return 0;
 297 }
 300 static void pbkdf2_sha1_f(const char *passphrase, const char *ssid,
size_t ssid_len, int iterations, unsigned int count,
u8 *digest)
 303 {
 304         unsigned char tmp[SHA1_MAC_LEN], tmp2[SHA1_MAC_LEN];
 305         int i, j;
 306         unsigned char count_buf[4];
 307         const u8 *addr[2];
size_t len[2];
size_t passphrase_len = strlen(passphrase);
addr[0] = (u8 *) ssid;
len[0] = ssid_len;
addr[1] = count_buf;
len[1] = 4;
 316         /* F(P, S, c, i) = U1 xor U2 xor ... Uc
 317          * U1 = PRF(P, S || i)
 318          * U2 = PRF(P, U1)
 319          * Uc = PRF(P, Uc-1)
 320          */
count_buf[0] = (count >> 24) & 0xff;
count_buf[1] = (count >> 16) & 0xff;
count_buf[2] = (count >> 8) & 0xff;
count_buf[3] = count & 0xff;
hmac_sha1_vector((u8 *) passphrase, passphrase_len, 2, addr, len, tmp);
memcpy(digest, tmp, SHA1_MAC_LEN);
 329         for (i = 1; i < iterations; i++) {
hmac_sha1((u8 *) passphrase, passphrase_len, tmp, SHA1_MAC_LEN,
tmp2);
memcpy(tmp, tmp2, SHA1_MAC_LEN);
 333                 for (j = 0; j < SHA1_MAC_LEN; j++)
digest[j] ^= tmp2[j];
 335         }
 336 }
 339 /**
 340  * pbkdf2_sha1 - SHA1-based key derivation function (PBKDF2) for IEEE 802.11i
 341  * @passphrase: ASCII passphrase
 342  * @ssid: SSID
 343  * @ssid_len: SSID length in bytes
 344  * @interations: Number of iterations to run
 345  * @buf: Buffer for the generated key
 346  * @buflen: Length of the buffer in bytes
 347  *
 348  * This function is used to derive PSK for WPA-PSK. For this protocol,
 349  * iterations is set to 4096 and buflen to 32. This function is described in
 350  * IEEE Std 802.11-2004, Clause H.4. The main construction is from PKCS#5 v2.0.
 351  */
 352 void pbkdf2_sha1(const char *passphrase, const char *ssid, size_t ssid_len,
 353                  int iterations, u8 *buf, size_t buflen)
 354 {
 355         unsigned int count = 0;
 356         unsigned char *pos = buf;
size_t left = buflen, plen;
 358         unsigned char digest[SHA1_MAC_LEN];
 360         while (left > 0) {
count++;
pbkdf2_sha1_f(passphrase, ssid, ssid_len, iterations, count,
digest);
plen = left > SHA1_MAC_LEN ? SHA1_MAC_LEN : left;
memcpy(pos, digest, plen);
pos += plen;
left -= plen;
 368         }
 369 }
 372 struct SHA1Context {
u32 state[5];
u32 count[2];
 375         unsigned char buffer[64];
 376 };
 378 typedef struct SHA1Context SHA1_CTX;
 380 #ifndef CONFIG_CRYPTO_INTERNAL
 381 static void SHA1Init(struct SHA1Context *context);
 382 static void SHA1Update(struct SHA1Context *context, const void *data, u32 len);
 383 static void SHA1Final(unsigned char digest[20], struct SHA1Context *context);
 384 #endif /* CONFIG_CRYPTO_INTERNAL */
 385 static void SHA1Transform(u32 state[5], const unsigned char buffer[64]);
 387 /**
 388  * sha1_vector - SHA-1 hash for data vector
 389  * @num_elem: Number of elements in the data vector
 390  * @addr: Pointers to the data areas
 391  * @len: Lengths of the data blocks
 392  * @mac: Buffer for the hash
 393  */
 394 void sha1_vector(size_t num_elem, const u8 *addr[], const size_t *len,
u8 *mac)
 396 {
SHA1_CTX ctx;
size_t i;
SHA1Init(&ctx);
 401         for (i = 0; i < num_elem; i++)
SHA1Update(&ctx, addr[i], len[i]);
SHA1Final(mac, &ctx);
 404 }
 407 int fips186_2_prf(const u8 *seed, size_t seed_len, u8 *x, size_t xlen)
 408 {
u8 xkey[64];
u32 t[5], _t[5];
 411         int i, j, m, k;
u8 *xpos = x;
u32 carry;
 415         if (seed_len > sizeof(xkey))
seed_len = sizeof(xkey);
 418         /* FIPS 186-2 + change notice 1 */
memcpy(xkey, seed, seed_len);
memset(xkey + seed_len, 0, 64 - seed_len);
t[0] = 0x67452301;
t[1] = 0xEFCDAB89;
t[2] = 0x98BADCFE;
t[3] = 0x10325476;
t[4] = 0xC3D2E1F0;
m = xlen / 40;
 429         for (j = 0; j < m; j++) {
 430                 /* XSEED_j = 0 */
 431                 for (i = 0; i < 2; i++) {
 432                         /* XVAL = (XKEY + XSEED_j) mod 2^b */
 434                         /* w_i = G(t, XVAL) */
memcpy(_t, t, 20);
SHA1Transform(_t, xkey);
_t[0] = host_to_be32(_t[0]);
_t[1] = host_to_be32(_t[1]);
_t[2] = host_to_be32(_t[2]);
_t[3] = host_to_be32(_t[3]);
_t[4] = host_to_be32(_t[4]);
memcpy(xpos, _t, 20);
 444                         /* XKEY = (1 + XKEY + w_i) mod 2^b */
carry = 1;
 446                         for (k = 19; k >= 0; k--) {
carry += xkey[k] + xpos[k];
xkey[k] = carry & 0xff;
carry >>= 8;
 450                         }
xpos += SHA1_MAC_LEN;
 453                 }
 454                 /* x_j = w_0|w_1 */
 455         }
 457         return 0;
 458 }
 461 /* ===== start - public domain SHA1 implementation ===== */
 463 /*
 464 SHA-1 in C
 465 By Steve Reid <sreid@sea-to-sky.net>
 466 100% Public Domain
 467 
 468 -----------------
 469 Modified 7/98 
 470 By James H. Brown <jbrown@burgoyne.com>
 471 Still 100% Public Domain
 472 
 473 Corrected a problem which generated improper hash values on 16 bit machines
 474 Routine SHA1Update changed from
 475         void SHA1Update(SHA1_CTX* context, unsigned char* data, unsigned int
 476 len)
 477 to
 478         void SHA1Update(SHA1_CTX* context, unsigned char* data, unsigned
 479 long len)
 480 
 481 The 'len' parameter was declared an int which works fine on 32 bit machines.
 482 However, on 16 bit machines an int is too small for the shifts being done
 483 against
 484 it.  This caused the hash function to generate incorrect values if len was
 485 greater than 8191 (8K - 1) due to the 'len << 3' on line 3 of SHA1Update().
 486 
 487 Since the file IO in main() reads 16K at a time, any file 8K or larger would
 488 be guaranteed to generate the wrong hash (e.g. Test Vector #3, a million
 489 "a"s).
 490 
 491 I also changed the declaration of variables i & j in SHA1Update to 
 492 unsigned long from unsigned int for the same reason.
 493 
 494 These changes should make no difference to any 32 bit implementations since
 495 an
 496 int and a long are the same size in those environments.
 497 
 498 --
 499 I also corrected a few compiler warnings generated by Borland C.
 500 1. Added #include <process.h> for exit() prototype
 501 2. Removed unused variable 'j' in SHA1Final
 502 3. Changed exit(0) to return(0) at end of main.
 503 
 504 ALL changes I made can be located by searching for comments containing 'JHB'
 505 -----------------
 506 Modified 8/98
 507 By Steve Reid <sreid@sea-to-sky.net>
 508 Still 100% public domain
 509 
 510 1- Removed #include <process.h> and used return() instead of exit()
 511 2- Fixed overwriting of finalcount in SHA1Final() (discovered by Chris Hall)
 512 3- Changed email address from steve@edmweb.com to sreid@sea-to-sky.net
 513 
 514 -----------------
 515 Modified 4/01
 516 By Saul Kravitz <Saul.Kravitz@celera.com>
 517 Still 100% PD
 518 Modified to run on Compaq Alpha hardware.  
 519 
 520 -----------------
 521 Modified 4/01
 522 By Jouni Malinen <j@w1.fi>
 523 Minor changes to match the coding style used in Dynamics.
 524 
 525 Modified September 24, 2004
 526 By Jouni Malinen <j@w1.fi>
 527 Fixed alignment issue in SHA1Transform when SHA1HANDSOFF is defined.
 528 
 529 */
 531 /*
 532 Test Vectors (from FIPS PUB 180-1)
 533 "abc"
 534   A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D
 535 "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
 536   84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1
 537 A million repetitions of "a"
 538   34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F
 539 */
 541 #define SHA1HANDSOFF
 543 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
 545 /* blk0() and blk() perform the initial expand. */
 546 /* I got the idea of expanding during the round function from SSLeay */
 547 #ifndef WORDS_BIGENDIAN
 548 #define blk0(i) (block->l[i] = (rol(block->l[i], 24) & 0xFF00FF00) | \
 549         (rol(block->l[i], 8) & 0x00FF00FF))
 550 #else
 551 #define blk0(i) block->l[i]
 552 #endif
 553 #define blk(i) (block->l[i & 15] = rol(block->l[(i + 13) & 15] ^ \
block->l[(i + 8) & 15] ^ block->l[(i + 2) & 15] ^ block->l[i & 15], 1))
 556 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
 557 #define R0(v,w,x,y,z,i) \
z += ((w & (x ^ y)) ^ y) + blk0(i) + 0x5A827999 + rol(v, 5); \
w = rol(w, 30);
 560 #define R1(v,w,x,y,z,i) \
z += ((w & (x ^ y)) ^ y) + blk(i) + 0x5A827999 + rol(v, 5); \
w = rol(w, 30);
 563 #define R2(v,w,x,y,z,i) \
z += (w ^ x ^ y) + blk(i) + 0x6ED9EBA1 + rol(v, 5); w = rol(w, 30);
 565 #define R3(v,w,x,y,z,i) \
z += (((w | x) & y) | (w & x)) + blk(i) + 0x8F1BBCDC + rol(v, 5); \
w = rol(w, 30);
 568 #define R4(v,w,x,y,z,i) \
z += (w ^ x ^ y) + blk(i) + 0xCA62C1D6 + rol(v, 5); \
w=rol(w, 30);
 573 #ifdef VERBOSE  /* SAK */
 574 void SHAPrintContext(SHA1_CTX *context, char *msg)
 575 {
printf("%s (%d,%d) %x %x %x %x %x\n",
msg,
context->count[0], context->count[1], 
context->state[0],
context->state[1],
context->state[2],
context->state[3],
context->state[4]);
 584 }
 585 #endif
 587 /* Hash a single 512-bit block. This is the core of the algorithm. */
 589 static void SHA1Transform(u32 state[5], const unsigned char buffer[64])
 590 {
u32 a, b, c, d, e;
 592         typedef union {
 593                 unsigned char c[64];
u32 l[16];
 595         } CHAR64LONG16;
CHAR64LONG16* block;
 597 #ifdef SHA1HANDSOFF
u32 workspace[16];
block = (CHAR64LONG16 *) workspace;
memcpy(block, buffer, 64);
 601 #else
block = (CHAR64LONG16 *) buffer;
 603 #endif
 604         /* Copy context->state[] to working vars */
a = state[0];
b = state[1];
c = state[2];
d = state[3];
e = state[4];
 610         /* 4 rounds of 20 operations each. Loop unrolled. */
R0(a,b,c,d,e, 0); R0(e,a,b,c,d, 1); R0(d,e,a,b,c, 2); R0(c,d,e,a,b, 3);
R0(b,c,d,e,a, 4); R0(a,b,c,d,e, 5); R0(e,a,b,c,d, 6); R0(d,e,a,b,c, 7);
R0(c,d,e,a,b, 8); R0(b,c,d,e,a, 9); R0(a,b,c,d,e,10); R0(e,a,b,c,d,11);
R0(d,e,a,b,c,12); R0(c,d,e,a,b,13); R0(b,c,d,e,a,14); R0(a,b,c,d,e,15);
R1(e,a,b,c,d,16); R1(d,e,a,b,c,17); R1(c,d,e,a,b,18); R1(b,c,d,e,a,19);
R2(a,b,c,d,e,20); R2(e,a,b,c,d,21); R2(d,e,a,b,c,22); R2(c,d,e,a,b,23);
R2(b,c,d,e,a,24); R2(a,b,c,d,e,25); R2(e,a,b,c,d,26); R2(d,e,a,b,c,27);
R2(c,d,e,a,b,28); R2(b,c,d,e,a,29); R2(a,b,c,d,e,30); R2(e,a,b,c,d,31);
R2(d,e,a,b,c,32); R2(c,d,e,a,b,33); R2(b,c,d,e,a,34); R2(a,b,c,d,e,35);
R2(e,a,b,c,d,36); R2(d,e,a,b,c,37); R2(c,d,e,a,b,38); R2(b,c,d,e,a,39);
R3(a,b,c,d,e,40); R3(e,a,b,c,d,41); R3(d,e,a,b,c,42); R3(c,d,e,a,b,43);
R3(b,c,d,e,a,44); R3(a,b,c,d,e,45); R3(e,a,b,c,d,46); R3(d,e,a,b,c,47);
R3(c,d,e,a,b,48); R3(b,c,d,e,a,49); R3(a,b,c,d,e,50); R3(e,a,b,c,d,51);
R3(d,e,a,b,c,52); R3(c,d,e,a,b,53); R3(b,c,d,e,a,54); R3(a,b,c,d,e,55);
R3(e,a,b,c,d,56); R3(d,e,a,b,c,57); R3(c,d,e,a,b,58); R3(b,c,d,e,a,59);
R4(a,b,c,d,e,60); R4(e,a,b,c,d,61); R4(d,e,a,b,c,62); R4(c,d,e,a,b,63);
R4(b,c,d,e,a,64); R4(a,b,c,d,e,65); R4(e,a,b,c,d,66); R4(d,e,a,b,c,67);
R4(c,d,e,a,b,68); R4(b,c,d,e,a,69); R4(a,b,c,d,e,70); R4(e,a,b,c,d,71);
R4(d,e,a,b,c,72); R4(c,d,e,a,b,73); R4(b,c,d,e,a,74); R4(a,b,c,d,e,75);
R4(e,a,b,c,d,76); R4(d,e,a,b,c,77); R4(c,d,e,a,b,78); R4(b,c,d,e,a,79);
 631         /* Add the working vars back into context.state[] */
state[0] += a;
state[1] += b;
state[2] += c;
state[3] += d;
state[4] += e;
 637         /* Wipe variables */
a = b = c = d = e = 0;
 639 #ifdef SHA1HANDSOFF
memset(block, 0, 64);
 641 #endif
 642 }
 645 /* SHA1Init - Initialize new context */
 647 void SHA1Init(SHA1_CTX* context)
 648 {
 649         /* SHA1 initialization constants */
context->state[0] = 0x67452301;
context->state[1] = 0xEFCDAB89;
context->state[2] = 0x98BADCFE;
context->state[3] = 0x10325476;
context->state[4] = 0xC3D2E1F0;
context->count[0] = context->count[1] = 0;
 656 }
 659 /* Run your data through this. */
 661 void SHA1Update(SHA1_CTX* context, const void *_data, u32 len)
 662 {
u32 i, j;
 664         const unsigned char *data = _data;
 666 #ifdef VERBOSE
SHAPrintContext(context, "before");
 668 #endif
j = (context->count[0] >> 3) & 63;
 670         if ((context->count[0] += len << 3) < (len << 3))
context->count[1]++;
context->count[1] += (len >> 29);
 673         if ((j + len) > 63) {
memcpy(&context->buffer[j], data, (i = 64-j));
SHA1Transform(context->state, context->buffer);
 676                 for ( ; i + 63 < len; i += 64) {
SHA1Transform(context->state, &data[i]);
 678                 }
j = 0;
 680         }
 681         else i = 0;
memcpy(&context->buffer[j], &data[i], len - i);
 683 #ifdef VERBOSE
SHAPrintContext(context, "after ");
 685 #endif
 686 }
 689 /* Add padding and return the message digest. */
 691 void SHA1Final(unsigned char digest[20], SHA1_CTX* context)
 692 {
u32 i;
 694         unsigned char finalcount[8];
 696         for (i = 0; i < 8; i++) {
finalcount[i] = (unsigned char)
 698                         ((context->count[(i >= 4 ? 0 : 1)] >>
 699                           ((3-(i & 3)) * 8) ) & 255);  /* Endian independent */
 700         }
SHA1Update(context, (unsigned char *) "\200", 1);
 702         while ((context->count[0] & 504) != 448) {
SHA1Update(context, (unsigned char *) "\0", 1);
 704         }
SHA1Update(context, finalcount, 8);  /* Should cause a SHA1Transform()
 706                                               */
 707         for (i = 0; i < 20; i++) {
digest[i] = (unsigned char)
 709                         ((context->state[i >> 2] >> ((3 - (i & 3)) * 8)) &
 710                          255);
 711         }
 712         /* Wipe variables */
i = 0;
memset(context->buffer, 0, 64);
memset(context->state, 0, 20);
memset(context->count, 0, 8);
memset(finalcount, 0, 8);
 718 }
 720 /* ===== end - public domain SHA1 implementation ===== */