2
* sha1.cpp - Secure Hash Algorithm 1
3
* Copyright (C) 2003 Justin Karneges
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.
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.
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
25
/****************************************************************************
26
SHA1 - from a public domain implementation by Steve Reid (steve@edmweb.com)
27
****************************************************************************/
29
#define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
30
#define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15]^block->l[(i+2)&15]^block->l[i&15],1))
32
/* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
33
#define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
34
#define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
35
#define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
36
#define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
37
#define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
44
qSysInfo(&wordSize, &bigEndian);
47
unsigned long SHA1::blk0(Q_UINT32 i)
52
return (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) | (rol(block->l[i],8)&0x00FF00FF));
55
// Hash a single 512-bit block. This is the core of the algorithm.
56
void SHA1::transform(Q_UINT32 state[5], unsigned char buffer[64])
58
Q_UINT32 a, b, c, d, e;
60
block = (CHAR64LONG16*)buffer;
62
// Copy context->state[] to working vars
69
// 4 rounds of 20 operations each. Loop unrolled.
70
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);
71
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);
72
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);
73
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);
74
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);
75
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);
76
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);
77
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);
78
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);
79
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);
80
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);
81
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);
82
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);
83
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);
84
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);
85
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);
86
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);
87
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);
88
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);
89
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);
91
// Add the working vars back into context.state[]
99
a = b = c = d = e = 0;
102
// SHA1Init - Initialize new context
103
void SHA1::init(SHA1_CONTEXT* context)
105
// SHA1 initialization constants
106
context->state[0] = 0x67452301;
107
context->state[1] = 0xEFCDAB89;
108
context->state[2] = 0x98BADCFE;
109
context->state[3] = 0x10325476;
110
context->state[4] = 0xC3D2E1F0;
111
context->count[0] = context->count[1] = 0;
114
// Run your data through this
115
void SHA1::update(SHA1_CONTEXT* context, unsigned char* data, Q_UINT32 len)
119
j = (context->count[0] >> 3) & 63;
120
if((context->count[0] += len << 3) < (len << 3))
123
context->count[1] += (len >> 29);
126
memcpy(&context->buffer[j], data, (i = 64-j));
127
transform(context->state, context->buffer);
128
for ( ; i + 63 < len; i += 64) {
129
transform(context->state, &data[i]);
134
memcpy(&context->buffer[j], &data[i], len - i);
137
// Add padding and return the message digest
138
void SHA1::final(unsigned char digest[20], SHA1_CONTEXT* context)
141
unsigned char finalcount[8];
143
for (i = 0; i < 8; i++) {
144
finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)]
145
>> ((3-(i & 3)) * 8) ) & 255); // Endian independent
147
update(context, (unsigned char *)"\200", 1);
148
while ((context->count[0] & 504) != 448) {
149
update(context, (unsigned char *)"\0", 1);
151
update(context, finalcount, 8); // Should cause a transform()
152
for (i = 0; i < 20; i++) {
153
digest[i] = (unsigned char) ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
158
memset(context->buffer, 0, 64);
159
memset(context->state, 0, 20);
160
memset(context->count, 0, 8);
161
memset(&finalcount, 0, 8);
164
QByteArray SHA1::hash(const QByteArray &a)
166
SHA1_CONTEXT context;
171
s.update(&context, (unsigned char *)a.data(), (unsigned int)a.size());
172
s.final((unsigned char *)b.data(), &context);
176
QByteArray SHA1::hashString(const QCString &cs)
178
QByteArray a(cs.length());
179
memcpy(a.data(), cs.data(), a.size());
180
return SHA1::hash(a);
183
QString SHA1::digest(const QString &in)
185
QByteArray a = SHA1::hashString(in.utf8());
187
for(int n = 0; n < (int)a.size(); ++n) {
189
str.sprintf("%02x", (uchar)a[n]);