drivers/net/wireless/rtlink/Utility/sha1.cpp

   1 /*
   2  * The contents of this file are subject to the Mozilla Public
   3  * License Version 1.1 (the "License"); you may not use this file
   4  * except in compliance with the License. You may obtain a copy of
   5  * the License at http://www.mozilla.org/MPL/
   6  *
   7  * Software distributed under the License is distributed on an "AS
   8  * IS" basis, WITHOUT WARRANTY OF ANY KIND, either express or
   9  * implied. See the License for the specific language governing
  10  * rights and limitations under the License.
  11  *
  12  * The Original Code is SHA 180-1 Reference Implementation (Compact version)
  13  *
  14  * The Initial Developer of the Original Code is Paul Kocher of
  15  * Cryptography Research.  Portions created by Paul Kocher are
  16  * Copyright (C) 1995-9 by Cryptography Research, Inc.  All
  17  * Rights Reserved.
  18  *
  19  * Contributor(s):
  20  *
  21  */
  22
  23 #include "sha1.h"
  24
  25 static void shaHashBlock(A_SHA_CTX *ctx);
  26
  27 void A_SHAInit(A_SHA_CTX *ctx)
  28 {
  29     int i;
  30
  31     ctx->lenW = 0;
  32     ctx->sizeHi = ctx->sizeLo = 0;
  33
  34     /* Initialize H with the magic constants (see FIPS180 for constants)
  35      */
  36     ctx->H[0] = 0x67452301L;
  37     ctx->H[1] = 0xefcdab89L;
  38     ctx->H[2] = 0x98badcfeL;
  39     ctx->H[3] = 0x10325476L;
  40     ctx->H[4] = 0xc3d2e1f0L;
  41
  42     for (i = 0; i < 80; i++)
  43         ctx->W[i] = 0;
  44 }
  45
  46
  47 void A_SHAUpdate(A_SHA_CTX *ctx, unsigned char *dataIn, int len)
  48 {
  49     int i;
  50
  51     /* Read the data into W and process blocks as they get full */
  52     for (i = 0; i < len; i++)
  53     {
  54         ctx->W[ctx->lenW / 4] <<= 8;
  55         ctx->W[ctx->lenW / 4] |= (unsigned long)dataIn[i];
  56         if ((++ctx->lenW) % 64 == 0)
  57         {
  58             shaHashBlock(ctx);
  59             ctx->lenW = 0;
  60         }
  61         ctx->sizeLo += 8;
  62         ctx->sizeHi += (ctx->sizeLo < 8);
  63     }
  64 }
  65
  66
  67 void A_SHAFinal(A_SHA_CTX *ctx, unsigned char hashout[20])
  68 {
  69     unsigned char pad0x80 = 0x80;
  70     unsigned char pad0x00 = 0x00;
  71     unsigned char padlen[8];
  72     int i;
  73
  74     /* Pad with a binary 1 (e.g. 0x80), then zeroes, then length */
  75     padlen[0] = (unsigned char)((ctx->sizeHi >> 24) & 255);
  76     padlen[1] = (unsigned char)((ctx->sizeHi >> 16) & 255);
  77     padlen[2] = (unsigned char)((ctx->sizeHi >> 8) & 255);
  78     padlen[3] = (unsigned char)((ctx->sizeHi >> 0) & 255);
  79     padlen[4] = (unsigned char)((ctx->sizeLo >> 24) & 255);
  80     padlen[5] = (unsigned char)((ctx->sizeLo >> 16) & 255);
  81     padlen[6] = (unsigned char)((ctx->sizeLo >> 8) & 255);
  82     padlen[7] = (unsigned char)((ctx->sizeLo >> 0) & 255);
  83     A_SHAUpdate(ctx, &pad0x80, 1);
  84     while (ctx->lenW != 56)
  85         A_SHAUpdate(ctx, &pad0x00, 1);
  86     A_SHAUpdate(ctx, padlen, 8);
  87
  88     /* Output hash
  89      */
  90     for (i = 0; i < 20; i++)
  91     {
  92         hashout[i] = (unsigned char)(ctx->H[i / 4] >> 24);
  93         ctx->H[i / 4] <<= 8;
  94     }
  95
  96     /*
  97      *  Re-initialize the context (also zeroizes contents)
  98      */
  99     A_SHAInit(ctx);
 100 }
 101
 102 #define SHA_ROTL(X,n) ((((X) << (n)) | ((X) >> (32-(n)))) & 0xffffffffL)
 103
 104 static void shaHashBlock(A_SHA_CTX *ctx)
 105 {
 106     int t;
 107     unsigned long A,B,C,D,E,TEMP;
 108
 109     for (t = 16; t <= 79; t++)
 110         ctx->W[t] = SHA_ROTL(ctx->W[t-3] ^ ctx->W[t-8] ^ ctx->W[t-14] ^ ctx->W[t-16], 1);
 111
 112     A = ctx->H[0];
 113     B = ctx->H[1];
 114     C = ctx->H[2];
 115     D = ctx->H[3];
 116     E = ctx->H[4];
 117
 118     for (t = 0; t <= 19; t++)
 119     {
 120         TEMP = (SHA_ROTL(A,5) + (((C^D)&B)^D)     + E + ctx->W[t] + 0x5a827999L) & 0xffffffffL;
 121         E = D; D = C; C = SHA_ROTL(B, 30); B = A; A = TEMP;
 122     }
 123     for (t = 20; t <= 39; t++)
 124     {
 125         TEMP = (SHA_ROTL(A,5) + (B^C^D)           + E + ctx->W[t] + 0x6ed9eba1L) & 0xffffffffL;
 126         E = D; D = C; C = SHA_ROTL(B, 30); B = A; A = TEMP;
 127     }
 128     for (t = 40; t <= 59; t++)
 129     {
 130         TEMP = (SHA_ROTL(A,5) + ((B&C)|(D&(B|C))) + E + ctx->W[t] + 0x8f1bbcdcL) & 0xffffffffL;
 131         E = D; D = C; C = SHA_ROTL(B, 30); B = A; A = TEMP;
 132     }
 133     for (t = 60; t <= 79; t++)
 134     {
 135         TEMP = (SHA_ROTL(A,5) + (B^C^D)           + E + ctx->W[t] + 0xca62c1d6L) & 0xffffffffL;
 136         E = D; D = C; C = SHA_ROTL(B, 30); B = A; A = TEMP;
 137     }
 138
 139     ctx->H[0] += A;
 140     ctx->H[1] += B;
 141     ctx->H[2] += C;
 142     ctx->H[3] += D;
 143     ctx->H[4] += E;
 144 }
 145
 146