File: sha1.cpp

package info (click to toggle)
ufoai 2.5-4
  • links: PTS, VCS
  • area: main
  • in suites: buster
  • size: 82,128 kB
  • sloc: cpp: 225,227; python: 5,111; ansic: 4,133; php: 2,209; perl: 1,931; sh: 1,517; xml: 1,115; makefile: 401; sed: 11
file content (378 lines) | stat: -rw-r--r-- 9,926 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
/*
 * sha1.c
 *
 * Copyright (C) 1998, 2009
 * Paul E. Jones <paulej@packetizer.com>
 * All Rights Reserved
 *
 *****************************************************************************
 * $Id: sha1.c 12 2009-06-22 19:34:25Z paulej $
 *****************************************************************************
 *
 * Description:
 *     This file implements the Secure Hashing Standard as defined
 *     in FIPS PUB 180-1 published April 17, 1995.
 *
 *     The Secure Hashing Standard, which uses the Secure Hashing
 *     Algorithm (SHA), produces a 160-bit message digest for a
 *     given data stream.  In theory, it is highly improbable that
 *     two messages will produce the same message digest.  Therefore,
 *     this algorithm can serve as a means of providing a "fingerprint"
 *     for a message.
 *
 * Portability Issues:
 *     SHA-1 is defined in terms of 32-bit "words".  This code was
 *     written with the expectation that the processor has at least
 *     a 32-bit machine word size.  If the machine word size is larger,
 *     the code should still function properly.  One caveat to that
 *     is that the input functions taking characters and character
 *     arrays assume that only 8 bits of information are stored in each
 *     character.
 *
 * Caveats:
 *     SHA-1 is designed to work with messages less than 2^64 bits
 *     long. Although SHA-1 allows a message digest to be generated for
 *     messages of any number of bits less than 2^64, this
 *     implementation only works with messages with a length that is a
 *     multiple of the size of an 8-bit character.
 *
 */

#include "sha1.h"
#include "filesys.h"
#include "../shared/shared.h"

/*
 * Define the circular shift macro
 */
#define SHA1CircularShift(bits,word) \
	((((word) << (bits)) & 0xFFFFFFFF) | \
	((word) >> (32-(bits))))

/* Function prototypes */
static void Com_SHA1ProcessMessageBlock (SHA1Context *);
static void Com_SHA1PadMessage (SHA1Context *);

/**
 * SHA1Reset
 *
 * Description:
 *     This function will initialize the SHA1Context in preparation
 *     for computing a new message digest.
 *
 * Parameters:
 *     context: [in/out]
 * The context to reset.
 *
 * Returns:
 *     Nothing.
 *
 * Comments:
 */
void Com_SHA1Reset (SHA1Context *context)
{
	context->Length_Low = 0;
	context->Length_High = 0;
	context->Message_Block_Index = 0;

	context->Message_Digest[0] = 0x67452301;
	context->Message_Digest[1] = 0xEFCDAB89;
	context->Message_Digest[2] = 0x98BADCFE;
	context->Message_Digest[3] = 0x10325476;
	context->Message_Digest[4] = 0xC3D2E1F0;

	context->Computed = 0;
	context->Corrupted = 0;
}

/**
 * SHA1Result
 *
 * Description:
 *     This function will return the 160-bit message digest into the
 *     Message_Digest array within the SHA1Context provided
 *
 * Parameters:
 *     context: [in/out]
 * The context to use to calculate the SHA-1 hash.
 *
 * Returns:
 *     true if successful, false if it failed.
 *
 * Comments:
 */
bool Com_SHA1Result (SHA1Context *context)
{
	if (context->Corrupted) {
		return false;
	}

	if (!context->Computed) {
		Com_SHA1PadMessage(context);
		context->Computed = 1;
	}

	return true;
}

/**
 * SHA1Input
 *
 * Description:
 *     This function accepts an array of octets as the next portion of
 *     the message.
 *
 * Parameters:
 *     context: [in/out]
 * The SHA-1 context to update
 *     message_array: [in]
 * An array of characters representing the next portion of the
 * message.
 *     length: [in]
 * The length of the message in message_array
 *
 * Returns:
 *     Nothing.
 *
 * Comments:
 */
void Com_SHA1Input (SHA1Context *context, const unsigned char* message_array, unsigned length)
{
	if (!length) {
		return;
	}

	if (context->Computed || context->Corrupted) {
		context->Corrupted = 1;
		return;
	}

	while (length-- && !context->Corrupted) {
		context->Message_Block[context->Message_Block_Index++] = (*message_array & 0xFF);

		context->Length_Low += 8;
		/* Force it to 32 bits */
		context->Length_Low &= 0xFFFFFFFF;
		if (context->Length_Low == 0) {
			context->Length_High++;
			/* Force it to 32 bits */
			context->Length_High &= 0xFFFFFFFF;
			if (context->Length_High == 0) {
				/* Message is too long */
				context->Corrupted = 1;
			}
		}

		if (context->Message_Block_Index == 64) {
			Com_SHA1ProcessMessageBlock(context);
		}

		message_array++;
	}
}

/**
 * SHA1ProcessMessageBlock
 *
 * Description:
 *     This function will process the next 512 bits of the message
 *     stored in the Message_Block array.
 *
 * Parameters:
 *     None.
 *
 * Returns:
 *     Nothing.
 *
 * Comments:
 *     Many of the variable names in the SHAContext, especially the
 *     single character names, were used because those were the names
 *     used in the publication.
 */
static void Com_SHA1ProcessMessageBlock (SHA1Context *context)
{
	const unsigned K[] = /* Constants defined in SHA-1   */
	{ 0x5A827999, 0x6ED9EBA1, 0x8F1BBCDC, 0xCA62C1D6 };
	int t; /* Loop counter */
	unsigned temp; /* Temporary word value */
	unsigned W[80]; /* Word sequence*/
	unsigned A, B, C, D, E; /* Word buffers */

	/*
	 * Initialize the first 16 words in the array W
	 */
	for (t = 0; t < 16; t++) {
		W[t] = ((unsigned) context->Message_Block[t * 4]) << 24;
		W[t] |= ((unsigned) context->Message_Block[t * 4 + 1]) << 16;
		W[t] |= ((unsigned) context->Message_Block[t * 4 + 2]) << 8;
		W[t] |= ((unsigned) context->Message_Block[t * 4 + 3]);
	}

	for (t = 16; t < 80; t++) {
		W[t] = SHA1CircularShift(1,W[t-3] ^ W[t-8] ^ W[t-14] ^ W[t-16]);
	}

	A = context->Message_Digest[0];
	B = context->Message_Digest[1];
	C = context->Message_Digest[2];
	D = context->Message_Digest[3];
	E = context->Message_Digest[4];

	for (t = 0; t < 20; t++) {
		temp = SHA1CircularShift(5,A) + ((B & C) | ((~B) & D)) + E + W[t] + K[0];
		temp &= 0xFFFFFFFF;
		E = D;
		D = C;
		C = SHA1CircularShift(30,B);
		B = A;
		A = temp;
	}

	for (t = 20; t < 40; t++) {
		temp = SHA1CircularShift(5,A) + (B ^ C ^ D) + E + W[t] + K[1];
		temp &= 0xFFFFFFFF;
		E = D;
		D = C;
		C = SHA1CircularShift(30,B);
		B = A;
		A = temp;
	}

	for (t = 40; t < 60; t++) {
		temp = SHA1CircularShift(5,A) + ((B & C) | (B & D) | (C & D)) + E + W[t] + K[2];
		temp &= 0xFFFFFFFF;
		E = D;
		D = C;
		C = SHA1CircularShift(30,B);
		B = A;
		A = temp;
	}

	for (t = 60; t < 80; t++) {
		temp = SHA1CircularShift(5,A) + (B ^ C ^ D) + E + W[t] + K[3];
		temp &= 0xFFFFFFFF;
		E = D;
		D = C;
		C = SHA1CircularShift(30,B);
		B = A;
		A = temp;
	}

	context->Message_Digest[0] = (context->Message_Digest[0] + A) & 0xFFFFFFFF;
	context->Message_Digest[1] = (context->Message_Digest[1] + B) & 0xFFFFFFFF;
	context->Message_Digest[2] = (context->Message_Digest[2] + C) & 0xFFFFFFFF;
	context->Message_Digest[3] = (context->Message_Digest[3] + D) & 0xFFFFFFFF;
	context->Message_Digest[4] = (context->Message_Digest[4] + E) & 0xFFFFFFFF;

	context->Message_Block_Index = 0;
}

/**
 * SHA1PadMessage
 *
 * Description:
 *     According to the standard, the message must be padded to an even
 *     512 bits.  The first padding bit must be a '1'.  The last 64
 *     bits represent the length of the original message.  All bits in
 *     between should be 0.  This function will pad the message
 *     according to those rules by filling the Message_Block array
 *     accordingly.  It will also call SHA1ProcessMessageBlock()
 *     appropriately.  When it returns, it can be assumed that the
 *     message digest has been computed.
 *
 * Parameters:
 *     context: [in/out]
 * The context to pad
 *
 * Returns:
 *     Nothing.
 *
 * Comments:
 */
static void Com_SHA1PadMessage (SHA1Context *context)
{
	/*
	 * Check to see if the current message block is too small to hold
	 * the initial padding bits and length.  If so, we will pad the
	 * block, process it, and then continue padding into a second
	 * block.
	 */
	if (context->Message_Block_Index > 55) {
		context->Message_Block[context->Message_Block_Index++] = 0x80;
		while (context->Message_Block_Index < 64) {
			context->Message_Block[context->Message_Block_Index++] = 0;
		}

		Com_SHA1ProcessMessageBlock(context);

		while (context->Message_Block_Index < 56) {
			context->Message_Block[context->Message_Block_Index++] = 0;
		}
	} else {
		context->Message_Block[context->Message_Block_Index++] = 0x80;
		while (context->Message_Block_Index < 56) {
			context->Message_Block[context->Message_Block_Index++] = 0;
		}
	}

	/*
	 * Store the message length as the last 8 octets
	 */
	context->Message_Block[56] = (context->Length_High >> 24) & 0xFF;
	context->Message_Block[57] = (context->Length_High >> 16) & 0xFF;
	context->Message_Block[58] = (context->Length_High >> 8) & 0xFF;
	context->Message_Block[59] = (context->Length_High) & 0xFF;
	context->Message_Block[60] = (context->Length_Low >> 24) & 0xFF;
	context->Message_Block[61] = (context->Length_Low >> 16) & 0xFF;
	context->Message_Block[62] = (context->Length_Low >> 8) & 0xFF;
	context->Message_Block[63] = (context->Length_Low) & 0xFF;

	Com_SHA1ProcessMessageBlock(context);
}

bool Com_SHA1File (const char* filename, char digest[41])
{
	qFILE f;
	const int filelen = FS_OpenFile(filename, &f, FILE_READ);
	if (filelen < 1)
		return false;

	SHA1Context sha;
	Com_SHA1Reset(&sha);

	byte buf[1024];
	for (;;) {
		const int n = FS_Read(buf, sizeof(buf), &f);
		if (n < 1)
			break;
		Com_SHA1Input(&sha, buf, n);
	}

	if (!Com_SHA1Result(&sha)) {
		return false;
	}
	digest[0] = '\0';
	for (int i = 0; i < 5; i++) {
		Q_strcat(digest, 41, "%02x", sha.Message_Digest[i]);
	}
	return true;
}

bool Com_SHA1Buffer (const unsigned char* buf, unsigned int len, char digest[41])
{
	if (len < 1)
		return false;

	SHA1Context sha;
	Com_SHA1Reset(&sha);
	Com_SHA1Input(&sha, buf, len);

	if (!Com_SHA1Result(&sha)) {
		return false;
	}
	digest[0] = '\0';
	for (int i = 0; i < 5; i++) {
		Q_strcat(digest, 41, "%02x", sha.Message_Digest[i]);
	}
	return true;
}