00001
00002
00003
00004
00005
00006
00007
00008
00009
00010
00011
00012
00013
00014
00015
00016
00017
00018
00019
00020
00021
00022
00023
00024
00029 #include "sha1.h"
00030
00031 #ifdef SHA1_UTILITY_FUNCTIONS
00032 #define SHA1_MAX_FILE_BUFFER 8000
00033 #endif
00034
00035
00036 #ifndef ROL32
00037 #ifdef _MSC_VER
00038 #define ROL32(_val32, _nBits) _rotl(_val32, _nBits)
00039 #else
00040 #define ROL32(_val32, _nBits) (((_val32)<<(_nBits))|((_val32)>>(32-(_nBits))))
00041 #endif
00042 #endif
00043
00044 #ifdef SHA1_LITTLE_ENDIAN
00045 #define SHABLK0(i) (m_block->l[i] = \
00046 (ROL32(m_block->l[i],24) & 0xFF00FF00) | (ROL32(m_block->l[i],8) & 0x00FF00FF))
00047 #else
00048 #define SHABLK0(i) (m_block->l[i])
00049 #endif
00050
00051 #define SHABLK(i) (m_block->l[i&15] = ROL32(m_block->l[(i+13)&15] ^ m_block->l[(i+8)&15] \
00052 ^ m_block->l[(i+2)&15] ^ m_block->l[i&15],1))
00053
00054
00055 #define _R0(v,w,x,y,z,i) { z+=((w&(x^y))^y)+SHABLK0(i)+0x5A827999+ROL32(v,5); w=ROL32(w,30); }
00056 #define _R1(v,w,x,y,z,i) { z+=((w&(x^y))^y)+SHABLK(i)+0x5A827999+ROL32(v,5); w=ROL32(w,30); }
00057 #define _R2(v,w,x,y,z,i) { z+=(w^x^y)+SHABLK(i)+0x6ED9EBA1+ROL32(v,5); w=ROL32(w,30); }
00058 #define _R3(v,w,x,y,z,i) { z+=(((w|x)&y)|(w&x))+SHABLK(i)+0x8F1BBCDC+ROL32(v,5); w=ROL32(w,30); }
00059 #define _R4(v,w,x,y,z,i) { z+=(w^x^y)+SHABLK(i)+0xCA62C1D6+ROL32(v,5); w=ROL32(w,30); }
00060
00061 CSHA1::CSHA1()
00062 {
00063 m_block = (SHA1_WORKSPACE_BLOCK *)m_workspace;
00064
00065 Reset();
00066 }
00067
00068 CSHA1::~CSHA1()
00069 {
00070 Reset();
00071 }
00072
00073 void CSHA1::Reset()
00074 {
00075
00076 m_state[0] = 0x67452301;
00077 m_state[1] = 0xEFCDAB89;
00078 m_state[2] = 0x98BADCFE;
00079 m_state[3] = 0x10325476;
00080 m_state[4] = 0xC3D2E1F0;
00081
00082 m_count[0] = 0;
00083 m_count[1] = 0;
00084 }
00085
00086 void CSHA1::Transform(UINT_32 *state, UINT_8 *buffer)
00087 {
00088
00089 UINT_32 a = state[0], b = state[1], c = state[2], d = state[3], e = state[4];
00090
00091 memcpy(m_block, buffer, 64);
00092
00093
00094 _R0(a,b,c,d,e, 0);
00095 _R0(e,a,b,c,d, 1);
00096 _R0(d,e,a,b,c, 2);
00097 _R0(c,d,e,a,b, 3);
00098 _R0(b,c,d,e,a, 4);
00099 _R0(a,b,c,d,e, 5);
00100 _R0(e,a,b,c,d, 6);
00101 _R0(d,e,a,b,c, 7);
00102 _R0(c,d,e,a,b, 8);
00103 _R0(b,c,d,e,a, 9);
00104 _R0(a,b,c,d,e,10);
00105 _R0(e,a,b,c,d,11);
00106 _R0(d,e,a,b,c,12);
00107 _R0(c,d,e,a,b,13);
00108 _R0(b,c,d,e,a,14);
00109 _R0(a,b,c,d,e,15);
00110 _R1(e,a,b,c,d,16);
00111 _R1(d,e,a,b,c,17);
00112 _R1(c,d,e,a,b,18);
00113 _R1(b,c,d,e,a,19);
00114 _R2(a,b,c,d,e,20);
00115 _R2(e,a,b,c,d,21);
00116 _R2(d,e,a,b,c,22);
00117 _R2(c,d,e,a,b,23);
00118 _R2(b,c,d,e,a,24);
00119 _R2(a,b,c,d,e,25);
00120 _R2(e,a,b,c,d,26);
00121 _R2(d,e,a,b,c,27);
00122 _R2(c,d,e,a,b,28);
00123 _R2(b,c,d,e,a,29);
00124 _R2(a,b,c,d,e,30);
00125 _R2(e,a,b,c,d,31);
00126 _R2(d,e,a,b,c,32);
00127 _R2(c,d,e,a,b,33);
00128 _R2(b,c,d,e,a,34);
00129 _R2(a,b,c,d,e,35);
00130 _R2(e,a,b,c,d,36);
00131 _R2(d,e,a,b,c,37);
00132 _R2(c,d,e,a,b,38);
00133 _R2(b,c,d,e,a,39);
00134 _R3(a,b,c,d,e,40);
00135 _R3(e,a,b,c,d,41);
00136 _R3(d,e,a,b,c,42);
00137 _R3(c,d,e,a,b,43);
00138 _R3(b,c,d,e,a,44);
00139 _R3(a,b,c,d,e,45);
00140 _R3(e,a,b,c,d,46);
00141 _R3(d,e,a,b,c,47);
00142 _R3(c,d,e,a,b,48);
00143 _R3(b,c,d,e,a,49);
00144 _R3(a,b,c,d,e,50);
00145 _R3(e,a,b,c,d,51);
00146 _R3(d,e,a,b,c,52);
00147 _R3(c,d,e,a,b,53);
00148 _R3(b,c,d,e,a,54);
00149 _R3(a,b,c,d,e,55);
00150 _R3(e,a,b,c,d,56);
00151 _R3(d,e,a,b,c,57);
00152 _R3(c,d,e,a,b,58);
00153 _R3(b,c,d,e,a,59);
00154 _R4(a,b,c,d,e,60);
00155 _R4(e,a,b,c,d,61);
00156 _R4(d,e,a,b,c,62);
00157 _R4(c,d,e,a,b,63);
00158 _R4(b,c,d,e,a,64);
00159 _R4(a,b,c,d,e,65);
00160 _R4(e,a,b,c,d,66);
00161 _R4(d,e,a,b,c,67);
00162 _R4(c,d,e,a,b,68);
00163 _R4(b,c,d,e,a,69);
00164 _R4(a,b,c,d,e,70);
00165 _R4(e,a,b,c,d,71);
00166 _R4(d,e,a,b,c,72);
00167 _R4(c,d,e,a,b,73);
00168 _R4(b,c,d,e,a,74);
00169 _R4(a,b,c,d,e,75);
00170 _R4(e,a,b,c,d,76);
00171 _R4(d,e,a,b,c,77);
00172 _R4(c,d,e,a,b,78);
00173 _R4(b,c,d,e,a,79);
00174
00175
00176 state[0] += a;
00177 state[1] += b;
00178 state[2] += c;
00179 state[3] += d;
00180 state[4] += e;
00181
00182
00183 #ifdef SHA1_WIPE_VARIABLES
00184
00185 a = b = c = d = e = 0;
00186 #endif
00187 }
00188
00189
00190 void CSHA1::Update(UINT_8 *data, UINT_32 len)
00191 {
00192 UINT_32 i, j;
00193
00194 j = (m_count[0] >> 3) & 63;
00195
00196 if((m_count[0] += len << 3) < (len << 3))
00197 m_count[1]++;
00198
00199 m_count[1] += (len >> 29);
00200
00201 if((j + len) > 63) {
00202 i = 64 - j;
00203 memcpy(&m_buffer[j], data, i);
00204 Transform(m_state, m_buffer);
00205
00206 for( ; i + 63 < len; i += 64)
00207 Transform(m_state, &data[i]);
00208
00209 j = 0;
00210 } else
00211 i = 0;
00212
00213 memcpy(&m_buffer[j], &data[i], len - i);
00214 }
00215
00216 #ifdef SHA1_UTILITY_FUNCTIONS
00217
00218 bool CSHA1::HashFile(char *szFileName)
00219 {
00220 unsigned long ulFileSize, ulRest, ulBlocks;
00221 unsigned long i;
00222 UINT_8 uData[SHA1_MAX_FILE_BUFFER];
00223 FILE *fIn;
00224
00225 if(szFileName == NULL)
00226 return false;
00227
00228 fIn = fopen(szFileName, "rb");
00229 if(fIn == NULL)
00230 return false;
00231
00232 fseek(fIn, 0, SEEK_END);
00233 ulFileSize = (unsigned long)ftell(fIn);
00234 fseek(fIn, 0, SEEK_SET);
00235
00236 if(ulFileSize != 0) {
00237 ulBlocks = ulFileSize / SHA1_MAX_FILE_BUFFER;
00238 ulRest = ulFileSize % SHA1_MAX_FILE_BUFFER;
00239 } else {
00240 ulBlocks = 0;
00241 ulRest = 0;
00242 }
00243
00244 bool ret = true;
00245 size_t rets = -1;
00246
00247 for(i = 0; i < ulBlocks; i++) {
00248 rets = fread(uData, 1, SHA1_MAX_FILE_BUFFER, fIn);
00249 ret &= (rets > 0 );
00250 Update((UINT_8 *)uData, SHA1_MAX_FILE_BUFFER);
00251 }
00252
00253 if(ulRest != 0) {
00254 rets = fread(uData, 1, ulRest, fIn);
00255 ret &= (rets > 0 );
00256 Update((UINT_8 *)uData, ulRest);
00257 }
00258
00259 fclose(fIn);
00260 fIn = NULL;
00261 return ret;
00262 }
00263 #endif
00264
00265 void CSHA1::Final()
00266 {
00267 UINT_32 i;
00268 UINT_8 finalcount[8];
00269
00270 for(i = 0; i < 8; i++)
00271 finalcount[i] = (UINT_8)((m_count[((i >= 4) ? 0 : 1)]
00272 >> ((3 - (i & 3)) * 8) ) & 255);
00273
00274 Update((UINT_8 *)"\200", 1);
00275
00276 while ((m_count[0] & 504) != 448)
00277 Update((UINT_8 *)"\0", 1);
00278
00279 Update(finalcount, 8);
00280
00281 for(i = 0; i < 20; i++) {
00282 m_digest[i] = (UINT_8)((m_state[i >> 2] >> ((3 - (i & 3)) * 8) ) & 255);
00283 }
00284
00285
00286 #ifdef SHA1_WIPE_VARIABLES
00287 i = 0;
00288 memset(m_buffer, 0, 64);
00289 memset(m_state, 0, 20);
00290 memset(m_count, 0, 8);
00291 memset(finalcount, 0, 8);
00292 Transform(m_state, m_buffer);
00293 #endif
00294 }
00295
00296 #ifdef SHA1_UTILITY_FUNCTIONS
00297
00298 void CSHA1::ReportHash(char *szReport, unsigned char uReportType)
00299 {
00300 unsigned char i;
00301 char szTemp[16];
00302
00303 if(szReport == NULL)
00304 return;
00305
00306 if(uReportType == REPORT_HEX) {
00307
00308
00309
00310 for(i = 0; i < 20; i++) {
00311 sprintf(szTemp, "%02x", m_digest[i]);
00312 strcat(szReport, szTemp);
00313 }
00314 } else if(uReportType == REPORT_DIGIT) {
00315 sprintf(szTemp, "%u", m_digest[0]);
00316 strcat(szReport, szTemp);
00317
00318 for(i = 1; i < 20; i++) {
00319 sprintf(szTemp, " %u", m_digest[i]);
00320 strcat(szReport, szTemp);
00321 }
00322 } else
00323 strcpy(szReport, "Error: Unknown report type!");
00324 }
00325 #endif
00326
00327
00328 void CSHA1::GetHash(UINT_8 *puDest)
00329 {
00330 memcpy(puDest, m_digest, 20);
00331 }