reactos/dll/win32/advapi32/crypt/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., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
  18  */
  19
  20 #include <advapi32.h>
  21 #include "crypt.h"
  22
  23
  24 /* SHA Context Structure Declaration */
  25
  26 typedef struct {
  27    ULONG Unknown[6];
  28    ULONG State[5];
  29    ULONG Count[2];
  30    UCHAR Buffer[64];
  31 } SHA_CTX, *PSHA_CTX;
  32
  33 /* SHA1 Helper Macros */
  34
  35 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
  36 /* FIXME: This definition of DWORD2BE is little endian specific! */
  37 #define DWORD2BE(x) (((x) >> 24) & 0xff) | (((x) >> 8) & 0xff00) | (((x) << 8) & 0xff0000) | (((x) << 24) & 0xff000000);
  38 /* FIXME: This definition of blk0 is little endian specific! */
  39 #define blk0(i) (Block[i] = (rol(Block[i],24)&0xFF00FF00)|(rol(Block[i],8)&0x00FF00FF))
  40 #define blk1(i) (Block[i&15] = rol(Block[(i+13)&15]^Block[(i+8)&15]^Block[(i+2)&15]^Block[i&15],1))
  41 #define f1(x,y,z) (z^(x&(y^z)))
  42 #define f2(x,y,z) (x^y^z)
  43 #define f3(x,y,z) ((x&y)|(z&(x|y)))
  44 #define f4(x,y,z) (x^y^z)
  45 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
  46 #define R0(v,w,x,y,z,i) z+=f1(w,x,y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
  47 #define R1(v,w,x,y,z,i) z+=f1(w,x,y)+blk1(i)+0x5A827999+rol(v,5);w=rol(w,30);
  48 #define R2(v,w,x,y,z,i) z+=f2(w,x,y)+blk1(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
  49 #define R3(v,w,x,y,z,i) z+=f3(w,x,y)+blk1(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
  50 #define R4(v,w,x,y,z,i) z+=f4(w,x,y)+blk1(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
  51
  52 /* Hash a single 512-bit block. This is the core of the algorithm. */
  53 static VOID
  54 SHA1Transform(ULONG State[5], UCHAR Buffer[64])
  55 {
  56    ULONG a, b, c, d, e;
  57    ULONG *Block;
  58
  59    Block = (ULONG*)Buffer;
  60
  61    /* Copy Context->State[] to working variables */
  62    a = State[0];
  63    b = State[1];
  64    c = State[2];
  65    d = State[3];
  66    e = State[4];
  67
  68    /* 4 rounds of 20 operations each. Loop unrolled. */
  69    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);
  70    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);
  71    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);
  72    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);
  73    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);
  74    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);
  75    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);
  76    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);
  77    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);
  78    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);
  79    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);
  80    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);
  81    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);
  82    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);
  83    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);
  84    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);
  85    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);
  86    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);
  87    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);
  88    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);
  89
  90    /* Add the working variables back into Context->State[] */
  91    State[0] += a;
  92    State[1] += b;
  93    State[2] += c;
  94    State[3] += d;
  95    State[4] += e;
  96
  97    /* Wipe variables */
  98    a = b = c = d = e = 0;
  99 }
 100
 101
 102 /******************************************************************************
 103  * A_SHAInit [ADVAPI32.@]
 104  *
 105  * Initialize a SHA context structure.
 106  */
 107 VOID WINAPI
 108 A_SHAInit(PSHA_CTX Context)
 109 {
 110    /* SHA1 initialization constants */
 111    Context->State[0] = 0x67452301;
 112    Context->State[1] = 0xEFCDAB89;
 113    Context->State[2] = 0x98BADCFE;
 114    Context->State[3] = 0x10325476;
 115    Context->State[4] = 0xC3D2E1F0;
 116    Context->Count[0] =
 117    Context->Count[1] = 0;
 118 }
 119
 120 /******************************************************************************
 121  * A_SHAUpdate [ADVAPI32.@]
 122  *
 123  * Update a SHA context with a hashed data from supplied buffer.
 124  */
 125 VOID WINAPI
 126 A_SHAUpdate(PSHA_CTX Context, PCHAR Buffer, UINT BufferSize)
 127 {
 128    ULONG BufferContentSize;
 129
 130    BufferContentSize = Context->Count[1] & 63;
 131    Context->Count[1] += BufferSize;
 132    if (Context->Count[1] < BufferSize)
 133       Context->Count[0]++;
 134    Context->Count[0] += (BufferSize >> 29);
 135
 136    if (BufferContentSize + BufferSize < 64)
 137    {
 138       RtlCopyMemory(&Context->Buffer[BufferContentSize], Buffer,
 139                     BufferSize);
 140    }
 141    else
 142    {
 143       while (BufferContentSize + BufferSize >= 64)
 144       {
 145          RtlCopyMemory(Context->Buffer + BufferContentSize, Buffer,
 146                        64 - BufferContentSize);
 147          Buffer += 64 - BufferContentSize;
 148          BufferSize -= 64 - BufferContentSize;
 149          SHA1Transform(Context->State, Context->Buffer);
 150          BufferContentSize = 0;
 151       }
 152       RtlCopyMemory(Context->Buffer + BufferContentSize, Buffer, BufferSize);
 153    }
 154 }
 155
 156 /******************************************************************************
 157  * A_SHAFinal [ADVAPI32.@]
 158  *
 159  * Finalize SHA context and return the resulting hash.
 160  */
 161 VOID WINAPI
 162 A_SHAFinal(PSHA_CTX Context, PULONG Result)
 163 {
 164    INT Pad, Index;
 165    CHAR Buffer[72];
 166    ULONG *Count;
 167    ULONG BufferContentSize, LengthHi, LengthLo;
 168
 169    BufferContentSize = Context->Count[1] & 63;
 170    if (BufferContentSize >= 56)
 171       Pad = 56 + 64 - BufferContentSize;
 172    else
 173       Pad = 56 - BufferContentSize;
 174
 175    LengthHi = (Context->Count[0] << 3) | (Context->Count[1] >> (32 - 3));
 176    LengthLo = (Context->Count[1] << 3);
 177
 178    RtlZeroMemory(Buffer + 1, Pad - 1);
 179    Buffer[0] = 0x80;
 180    Count = (ULONG*)(Buffer + Pad);
 181    Count[0] = DWORD2BE(LengthHi);
 182    Count[1] = DWORD2BE(LengthLo);
 183    A_SHAUpdate(Context, Buffer, Pad + 8);
 184
 185    for (Index = 0; Index < 5; Index++)
 186       Result[Index] = DWORD2BE(Context->State[Index]);
 187
 188    A_SHAInit(Context);
 189 }