dlls/advapi32/crypt_sha.c

   1 /*
   2  * Copyright 2004 Filip Navara
   3  * Based on public domain SHA code by Steve Reid <steve@edmweb.com>
   4  *
   5  * This library is free software; you can redistribute it and/or
   6  * modify it under the terms of the GNU Lesser General Public
   7  * License as published by the Free Software Foundation; either
   8  * version 2.1 of the License, or (at your option) any later version.
   9  *
  10  * This library is distributed in the hope that it will be useful,
  11  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  13  * Lesser General Public License for more details.
  14  *
  15  * You should have received a copy of the GNU Lesser General Public
  16  * License along with this library; if not, write to the Free Software
  17  * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
  18  */
  19
  20 #include <stdarg.h>
  21 #include "windef.h"
  22
  23 /* SHA Context Structure Declaration */
  24
  25 typedef struct {
  26    ULONG Unknown[6];
  27    ULONG State[5];
  28    ULONG Count[2];
  29    UCHAR Buffer[64];
  30 } SHA_CTX, *PSHA_CTX;
  31
  32 /* SHA1 Helper Macros */
  33
  34 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
  35 /* FIXME: This definition of DWORD2BE is little endian specific! */
  36 #define DWORD2BE(x) (((x) >> 24) & 0xff) | (((x) >> 8) & 0xff00) | (((x) << 8) & 0xff0000) | (((x) << 24) & 0xff000000);
  37 /* FIXME: This definition of blk0 is little endian specific! */
  38 #define blk0(i) (Block[i] = (rol(Block[i],24)&0xFF00FF00)|(rol(Block[i],8)&0x00FF00FF))
  39 #define blk1(i) (Block[i&15] = rol(Block[(i+13)&15]^Block[(i+8)&15]^Block[(i+2)&15]^Block[i&15],1))
  40 #define f1(x,y,z) (z^(x&(y^z)))
  41 #define f2(x,y,z) (x^y^z)
  42 #define f3(x,y,z) ((x&y)|(z&(x|y)))
  43 #define f4(x,y,z) (x^y^z)
  44 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
  45 #define R0(v,w,x,y,z,i) z+=f1(w,x,y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
  46 #define R1(v,w,x,y,z,i) z+=f1(w,x,y)+blk1(i)+0x5A827999+rol(v,5);w=rol(w,30);
  47 #define R2(v,w,x,y,z,i) z+=f2(w,x,y)+blk1(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
  48 #define R3(v,w,x,y,z,i) z+=f3(w,x,y)+blk1(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
  49 #define R4(v,w,x,y,z,i) z+=f4(w,x,y)+blk1(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
  50
  51 /* Hash a single 512-bit block. This is the core of the algorithm. */
  52 static void SHA1Transform(ULONG State[5], UCHAR Buffer[64])
  53 {
  54    ULONG a, b, c, d, e;
  55    ULONG *Block;
  56
  57    Block = (ULONG*)Buffer;
  58
  59    /* Copy Context->State[] to working variables */
  60    a = State[0];
  61    b = State[1];
  62    c = State[2];
  63    d = State[3];
  64    e = State[4];
  65
  66    /* 4 rounds of 20 operations each. Loop unrolled. */
  67    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);
  68    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);
  69    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);
  70    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);
  71    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);
  72    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);
  73    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);
  74    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);
  75    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);
  76    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);
  77    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);
  78    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);
  79    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);
  80    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);
  81    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);
  82    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);
  83    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);
  84    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);
  85    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);
  86    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);
  87
  88    /* Add the working variables back into Context->State[] */
  89    State[0] += a;
  90    State[1] += b;
  91    State[2] += c;
  92    State[3] += d;
  93    State[4] += e;
  94
  95    /* Wipe variables */
  96    a = b = c = d = e = 0;
  97 }
  98
  99
 100 /******************************************************************************
 101  * A_SHAInit [ADVAPI32.@]
 102  *
 103  * Initialize a SHA context structure.
 104  *
 105  * PARAMS
 106  *  Context [O] SHA context
 107  *
 108  * RETURNS
 109  *  Nothing
 110  */
 111 VOID WINAPI
 112 A_SHAInit(PSHA_CTX Context)
 113 {
 114    /* SHA1 initialization constants */
 115    Context->State[0] = 0x67452301;
 116    Context->State[1] = 0xEFCDAB89;
 117    Context->State[2] = 0x98BADCFE;
 118    Context->State[3] = 0x10325476;
 119    Context->State[4] = 0xC3D2E1F0;
 120    Context->Count[0] =
 121    Context->Count[1] = 0;
 122 }
 123
 124 /******************************************************************************
 125  * A_SHAUpdate [ADVAPI32.@]
 126  *
 127  * Update a SHA context with a hashed data from supplied buffer.
 128  *
 129  * PARAMS
 130  *  Context    [O] SHA context
 131  *  Buffer     [I] hashed data
 132  *  BufferSize [I] hashed data size
 133  *
 134  * RETURNS
 135  *  Nothing
 136  */
 137 VOID WINAPI
 138 A_SHAUpdate(PSHA_CTX Context, const unsigned char *Buffer, UINT BufferSize)
 139 {
 140    ULONG BufferContentSize;
 141
 142    BufferContentSize = Context->Count[1] & 63;
 143    Context->Count[1] += BufferSize;
 144    if (Context->Count[1] < BufferSize)
 145       Context->Count[0]++;
 146    Context->Count[0] += (BufferSize >> 29);
 147
 148    if (BufferContentSize + BufferSize < 64)
 149    {
 150       RtlCopyMemory(&Context->Buffer[BufferContentSize], Buffer,
 151                     BufferSize);
 152    }
 153    else
 154    {
 155       while (BufferContentSize + BufferSize >= 64)
 156       {
 157          RtlCopyMemory(Context->Buffer + BufferContentSize, Buffer,
 158                        64 - BufferContentSize);
 159          Buffer += 64 - BufferContentSize;
 160          BufferSize -= 64 - BufferContentSize;
 161          SHA1Transform(Context->State, Context->Buffer);
 162          BufferContentSize = 0;
 163       }
 164       RtlCopyMemory(Context->Buffer + BufferContentSize, Buffer, BufferSize);
 165    }
 166 }
 167
 168 /******************************************************************************
 169  * A_SHAFinal [ADVAPI32.@]
 170  *
 171  * Finalize SHA context and return the resulting hash.
 172  *
 173  * PARAMS
 174  *  Context [I/O] SHA context
 175  *  Result  [O] resulting hash
 176  *
 177  * RETURNS
 178  *  Nothing
 179  */
 180 VOID WINAPI
 181 A_SHAFinal(PSHA_CTX Context, PULONG Result)
 182 {
 183    INT Pad, Index;
 184    UCHAR Buffer[72];
 185    ULONG *Count;
 186    ULONG BufferContentSize, LengthHi, LengthLo;
 187
 188    BufferContentSize = Context->Count[1] & 63;
 189    if (BufferContentSize >= 56)
 190       Pad = 56 + 64 - BufferContentSize;
 191    else
 192       Pad = 56 - BufferContentSize;
 193
 194    LengthHi = (Context->Count[0] << 3) | (Context->Count[1] >> (32 - 3));
 195    LengthLo = (Context->Count[1] << 3);
 196
 197    RtlZeroMemory(Buffer + 1, Pad - 1);
 198    Buffer[0] = 0x80;
 199    Count = (ULONG*)(Buffer + Pad);
 200    Count[0] = DWORD2BE(LengthHi);
 201    Count[1] = DWORD2BE(LengthLo);
 202    A_SHAUpdate(Context, Buffer, Pad + 8);
 203
 204    for (Index = 0; Index < 5; Index++)
 205       Result[Index] = DWORD2BE(Context->State[Index]);
 206
 207    A_SHAInit(Context);
 208 }