Search Code
About crypto

Published 29 Dec 2009.

Last change message: N/A

Import this program

crypto

Published 29 Dec 2009, by   user Anders Rundgren   tag No tags
Embed: (wiki syntax)

« Back to documentation index

Show/hide line numbers SHA256Provider.cpp Source File

SHA256Provider.cpp

00001 /* ====================================================================
00002  * Copyright (c) 1998-2010 The OpenSSL Project.  All rights reserved.
00003  *
00004  * This product includes cryptographic software written by Eric Young
00005  * (eay@cryptsoft.com).  This product includes software written by Tim
00006  * Hudson (tjh@cryptsoft.com).
00007  *
00008  * ====================================================================
00009  * C++ adoption was made by Anders Rundgren (anders.rundgren@telia.com)
00010  * ====================================================================
00011  */
00012 
00013 #include <string.h>
00014 #include <stdlib.h>
00015 
00016 #include "crypto.h"
00017 
00018 #include "_shacommon.h"
00019 
00020 /*
00021  * FIPS specification refers to right rotations, while our ROTATE macro
00022  * is left one. This is why you might notice that rotation coefficients
00023  * differ from those observed in FIPS document by 32-N...
00024  */
00025 #define Sigma0(x)   (ROTATE((x),30) ^ ROTATE((x),19) ^ ROTATE((x),10))
00026 #define Sigma1(x)   (ROTATE((x),26) ^ ROTATE((x),21) ^ ROTATE((x),7))
00027 #define sigma0(x)   (ROTATE((x),25) ^ ROTATE((x),14) ^ ((x)>>3))
00028 #define sigma1(x)   (ROTATE((x),15) ^ ROTATE((x),13) ^ ((x)>>10))
00029 
00030 #define Ch(x,y,z)   (((x) & (y)) ^ ((~(x)) & (z)))
00031 #define Maj(x,y,z)  (((x) & (y)) ^ ((x) & (z)) ^ ((y) & (z)))
00032 
00033 #define ROUND_00_15(i,a,b,c,d,e,f,g,h)      do {    \
00034     T1 += h + Sigma1(e) + Ch(e,f,g) + K256[i];  \
00035     h = Sigma0(a) + Maj(a,b,c);         \
00036     d += T1;    h += T1;        } while (0)
00037 
00038 #define ROUND_16_63(i,a,b,c,d,e,f,g,h,X)    do {    \
00039     s0 = X[(i+1) & 0x0f]; s0 = sigma0(s0);    \
00040     s1 = X[(i+14) & 0x0f]; s1 = sigma1(s1);    \
00041     T1 = X[(i) & 0x0f] += s0 + s1 + X[(i+9) & 0x0f];    \
00042     ROUND_00_15(i,a,b,c,d,e,f,g,h);     } while (0)
00043 
00044 static const CRYPTO_U32 K256[64] =
00045   {
00046     0x428a2f98UL,0x71374491UL,0xb5c0fbcfUL,0xe9b5dba5UL,
00047     0x3956c25bUL,0x59f111f1UL,0x923f82a4UL,0xab1c5ed5UL,
00048     0xd807aa98UL,0x12835b01UL,0x243185beUL,0x550c7dc3UL,
00049     0x72be5d74UL,0x80deb1feUL,0x9bdc06a7UL,0xc19bf174UL,
00050     0xe49b69c1UL,0xefbe4786UL,0x0fc19dc6UL,0x240ca1ccUL,
00051     0x2de92c6fUL,0x4a7484aaUL,0x5cb0a9dcUL,0x76f988daUL,
00052     0x983e5152UL,0xa831c66dUL,0xb00327c8UL,0xbf597fc7UL,
00053     0xc6e00bf3UL,0xd5a79147UL,0x06ca6351UL,0x14292967UL,
00054     0x27b70a85UL,0x2e1b2138UL,0x4d2c6dfcUL,0x53380d13UL,
00055     0x650a7354UL,0x766a0abbUL,0x81c2c92eUL,0x92722c85UL,
00056     0xa2bfe8a1UL,0xa81a664bUL,0xc24b8b70UL,0xc76c51a3UL,
00057     0xd192e819UL,0xd6990624UL,0xf40e3585UL,0x106aa070UL,
00058     0x19a4c116UL,0x1e376c08UL,0x2748774cUL,0x34b0bcb5UL,
00059     0x391c0cb3UL,0x4ed8aa4aUL,0x5b9cca4fUL,0x682e6ff3UL,
00060     0x748f82eeUL,0x78a5636fUL,0x84c87814UL,0x8cc70208UL,
00061     0x90befffaUL,0xa4506cebUL,0xbef9a3f7UL,0xc67178f2UL
00062   };
00063 
00064 
00065 namespace webpki
00066 {
00067 
00068 const int SHA256Provider::DIGEST_LENGTH;
00069 
00070 
00071 SHA256Provider::SHA256Provider ()
00072   {
00073     _init ();
00074   }
00075 
00076 
00077 void SHA256Provider::_init ()
00078   {
00079     m_error = NULL;
00080     m_needs_init = false;
00081     m_sha_ctx.h[0] = 0x6a09e667UL;   m_sha_ctx.h[1] = 0xbb67ae85UL;
00082     m_sha_ctx.h[2] = 0x3c6ef372UL;   m_sha_ctx.h[3] = 0xa54ff53aUL;
00083     m_sha_ctx.h[4] = 0x510e527fUL;   m_sha_ctx.h[5] = 0x9b05688cUL;
00084     m_sha_ctx.h[6] = 0x1f83d9abUL;   m_sha_ctx.h[7] = 0x5be0cd19UL;
00085     m_sha_ctx.Nl = 0;
00086     m_sha_ctx.Nh = 0;
00087     m_sha_ctx.num = 0;
00088     m_sha_ctx.digest_length = DIGEST_LENGTH;
00089   }
00090 
00091 
00092 void SHA256Provider::hash_block_data_order (const unsigned char* data, int num)
00093   {
00094     CRYPTO_U32 a, b, c, d, e, f, g, h, s0, s1, T1;
00095     CRYPTO_U32 X[16];
00096     int i;
00097     const union { long one; char little; } is_endian = {1};
00098 
00099     while (num--)
00100       {
00101         a = m_sha_ctx.h[0];  b = m_sha_ctx.h[1];  c = m_sha_ctx.h[2];  d = m_sha_ctx.h[3];
00102         e = m_sha_ctx.h[4];  f = m_sha_ctx.h[5];  g = m_sha_ctx.h[6];  h = m_sha_ctx.h[7];
00103 
00104         if (!is_endian.little && sizeof(CRYPTO_U32)==4 && ((size_t)data%4)==0)
00105           {
00106             const CRYPTO_U32 *W=(const CRYPTO_U32 *)data;
00107 
00108             T1 = X[0] = W[0];   ROUND_00_15(0,a,b,c,d,e,f,g,h);
00109             T1 = X[1] = W[1];   ROUND_00_15(1,h,a,b,c,d,e,f,g);
00110             T1 = X[2] = W[2];   ROUND_00_15(2,g,h,a,b,c,d,e,f);
00111             T1 = X[3] = W[3];   ROUND_00_15(3,f,g,h,a,b,c,d,e);
00112             T1 = X[4] = W[4];   ROUND_00_15(4,e,f,g,h,a,b,c,d);
00113             T1 = X[5] = W[5];   ROUND_00_15(5,d,e,f,g,h,a,b,c);
00114             T1 = X[6] = W[6];   ROUND_00_15(6,c,d,e,f,g,h,a,b);
00115             T1 = X[7] = W[7];   ROUND_00_15(7,b,c,d,e,f,g,h,a);
00116             T1 = X[8] = W[8];   ROUND_00_15(8,a,b,c,d,e,f,g,h);
00117             T1 = X[9] = W[9];   ROUND_00_15(9,h,a,b,c,d,e,f,g);
00118             T1 = X[10] = W[10]; ROUND_00_15(10,g,h,a,b,c,d,e,f);
00119             T1 = X[11] = W[11]; ROUND_00_15(11,f,g,h,a,b,c,d,e);
00120             T1 = X[12] = W[12]; ROUND_00_15(12,e,f,g,h,a,b,c,d);
00121             T1 = X[13] = W[13]; ROUND_00_15(13,d,e,f,g,h,a,b,c);
00122             T1 = X[14] = W[14]; ROUND_00_15(14,c,d,e,f,g,h,a,b);
00123             T1 = X[15] = W[15]; ROUND_00_15(15,b,c,d,e,f,g,h,a);
00124 
00125             data += SHA_CBLOCK;
00126           }
00127         else
00128           {
00129             CRYPTO_U32 l;
00130 
00131             HOST_c2l(data,l); T1 = X[0] = l;  ROUND_00_15(0,a,b,c,d,e,f,g,h);
00132             HOST_c2l(data,l); T1 = X[1] = l;  ROUND_00_15(1,h,a,b,c,d,e,f,g);
00133             HOST_c2l(data,l); T1 = X[2] = l;  ROUND_00_15(2,g,h,a,b,c,d,e,f);
00134             HOST_c2l(data,l); T1 = X[3] = l;  ROUND_00_15(3,f,g,h,a,b,c,d,e);
00135             HOST_c2l(data,l); T1 = X[4] = l;  ROUND_00_15(4,e,f,g,h,a,b,c,d);
00136             HOST_c2l(data,l); T1 = X[5] = l;  ROUND_00_15(5,d,e,f,g,h,a,b,c);
00137             HOST_c2l(data,l); T1 = X[6] = l;  ROUND_00_15(6,c,d,e,f,g,h,a,b);
00138             HOST_c2l(data,l); T1 = X[7] = l;  ROUND_00_15(7,b,c,d,e,f,g,h,a);
00139             HOST_c2l(data,l); T1 = X[8] = l;  ROUND_00_15(8,a,b,c,d,e,f,g,h);
00140             HOST_c2l(data,l); T1 = X[9] = l;  ROUND_00_15(9,h,a,b,c,d,e,f,g);
00141             HOST_c2l(data,l); T1 = X[10] = l; ROUND_00_15(10,g,h,a,b,c,d,e,f);
00142             HOST_c2l(data,l); T1 = X[11] = l; ROUND_00_15(11,f,g,h,a,b,c,d,e);
00143             HOST_c2l(data,l); T1 = X[12] = l; ROUND_00_15(12,e,f,g,h,a,b,c,d);
00144             HOST_c2l(data,l); T1 = X[13] = l; ROUND_00_15(13,d,e,f,g,h,a,b,c);
00145             HOST_c2l(data,l); T1 = X[14] = l; ROUND_00_15(14,c,d,e,f,g,h,a,b);
00146             HOST_c2l(data,l); T1 = X[15] = l; ROUND_00_15(15,b,c,d,e,f,g,h,a);
00147           }
00148 
00149         for (i=16;i<64;i+=8)
00150           {
00151             ROUND_16_63(i+0,a,b,c,d,e,f,g,h,X);
00152             ROUND_16_63(i+1,h,a,b,c,d,e,f,g,X);
00153             ROUND_16_63(i+2,g,h,a,b,c,d,e,f,X);
00154             ROUND_16_63(i+3,f,g,h,a,b,c,d,e,X);
00155             ROUND_16_63(i+4,e,f,g,h,a,b,c,d,X);
00156             ROUND_16_63(i+5,d,e,f,g,h,a,b,c,X);
00157             ROUND_16_63(i+6,c,d,e,f,g,h,a,b,X);
00158             ROUND_16_63(i+7,b,c,d,e,f,g,h,a,X);
00159           }
00160 
00161         m_sha_ctx.h[0] += a; m_sha_ctx.h[1] += b; m_sha_ctx.h[2] += c; m_sha_ctx.h[3] += d;
00162         m_sha_ctx.h[4] += e; m_sha_ctx.h[5] += f; m_sha_ctx.h[6] += g; m_sha_ctx.h[7] += h;
00163       }
00164   }
00165 
00166 
00167 }