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
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
|
#ifndef __DIGEST_H__
#define __DIGEST_H__
/**
* Secure Hashing Tool
*
*
* Author:
* Bob Jamison
*
* Copyright (C) 2006-2008 Bob Jamison
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
/**
*
* This base class and its subclasses provide an easy API for providing
* several different types of secure hashing functions for whatever use
* a developer might need. This is not intended as a high-performance
* replacement for the fine implementations already available. Rather, it
* is a small and simple (and maybe a bit slow?) tool for moderate common
* hashing requirements, like for communications and authentication.
*
* These hashes are intended to be simple to use. For example:
* Sha256 digest;
* digest.append("The quick brown dog");
* std::string result = digest.finishHex();
*
* Or, use one of the static convenience methods:
*
* example: std::string digest =
* Digest::hashHex(Digest::HASH_XXX, str);
*
* ...where HASH_XXX represents one of the hash
* algorithms listed in HashType.
*
* There are several forms of append() for convenience.
* finish() and finishHex() call reset() for both security and
* to prepare for the next use.
*
*
* Much effort has been applied to make this code portable, and it
* has been tested on various 32- and 64-bit machines. If you
* add another algorithm, please test it likewise.
*
*
* The SHA algorithms are derived directly from FIPS-180-3. The
* SHA tests at the bottom of digest.cpp are also directly from
* that document.
* http://csrc.nist.gov/publications/drafts/fips_180-3/draft_fips-180-3_June-08-2007.pdf
*
* The MD5 algorithm is from RFC 1321
*
* To run the tests, compile standalone with -DDIGEST_TEST. Example:
*
* g++ -DDIGEST_TEST digest.cpp -o testdigest
* or
* g++ -DDIGEST_TEST -m64 digest.cpp -o testdigest
*
*/
#include <vector>
#include <string>
/**
* Base class. Do not use instantiate class directly. Rather, use of of the
* subclasses below, or call one of this class's static convenience methods.
*
* For all subclasses, overload reset(), update(unsigned char),
* transform(), and finish()
*/
class Digest
{
public:
/**
* Different types of hash algorithms.
*/
typedef enum
{
HASH_NONE,
HASH_SHA1,
HASH_SHA224,
HASH_SHA256,
HASH_SHA384,
HASH_SHA512,
HASH_MD5
} HashType;
/**
* Constructor, with no type
*/
Digest() : hashType(HASH_NONE)
{ reset(); }
/**
* Destructor
*/
virtual ~Digest()
{ reset(); }
/**
* Return one of the enumerated hash types above
*/
virtual int getType()
{ return hashType; }
/**
* Append a single byte to the hash
*/
void append(unsigned char ch)
{ update(ch); }
/**
* Append a string to the hash
*/
virtual void append(const std::string &str)
{
for (unsigned int i=0 ; i<str.size() ; i++)
update((unsigned char)str[i]);
}
/**
* Append a byte buffer to the hash
*/
virtual void append(unsigned char *buf, int len)
{
for (int i=0 ; i<len ; i++)
update(buf[i]);
}
/**
* Append a byte vector to the hash
*/
virtual void append(const std::vector<unsigned char> buf)
{
for (unsigned int i=0 ; i<buf.size() ; i++)
update(buf[i]);
}
/**
* Finish the hash and return a hexidecimal version of the computed
* value
*/
virtual std::string finishHex();
/**
* Initialize the fields of this hash engine to its starting values.
* Overload this in every subclass
*/
virtual void reset()
{ clearByteCount(); }
/**
* Finish the hash and return its computed value
* Overload this in every subclass
*/
virtual std::vector<unsigned char> finish()
{
std::vector<unsigned char> ret;
return ret;
}
//########################
//# Convenience methods
//########################
/**
* Convenience method. This is a simple way of getting a hash.
* Returns a byte buffer with the digest output.
* call with: std::vector<unsigned char> digest =
* Digest::hash(Digest::HASH_XXX, buf, len);
*/
static std::vector<unsigned char> hash(HashType typ,
unsigned char *buf,
int len);
/**
* Convenience method. This is a simple way of getting a hash.
* Returns a byte buffer with the digest output.
* call with: std::vector<unsigned char> digest =
* Digest::hash(Digest::HASH_XXX, str);
*/
static std::vector<unsigned char> hash(HashType typ,
const std::string &str);
/**
* Convenience method. This is a simple way of getting a hash.
* Returns a string with the hexidecimal form of the digest output.
* call with: std::string digest =
* Digest::hash(Digest::HASH_XXX, buf, len);
*/
static std::string hashHex(HashType typ,
unsigned char *buf,
int len);
/**
* Convenience method. This is a simple way of getting a hash.
* Returns a string with the hexidecimal form of the digest output.
* call with: std::string digest =
* Digest::hash(Digest::HASH_XXX, str);
*/
static std::string hashHex(HashType typ,
const std::string &str);
protected:
/**
* Update the hash with a given byte
* Overload this in every subclass
*/
virtual void update(unsigned char /*ch*/)
{}
/**
* Perform the particular block hashing algorithm for a
* particular type of hash.
* Overload this in every subclass
*/
virtual void transform()
{}
/**
* The enumerated type of the hash
*/
int hashType;
/**
* Increment the count of bytes processed so far. Should be called
* in update()
*/
void incByteCount()
{
if (nrBytesLo == 0xffffffffL)
{
nrBytesHi++;
nrBytesLo = 0;
}
else
nrBytesLo++;
}
/**
* Clear the byte / bit count information. Both for processing
* another message, also for security. Should be called in reset()
*/
void clearByteCount()
{
nrBytesHi = nrBytesLo = 0;
nrBitsHi = nrBitsLo = 0;
}
/**
* Calculates the bit count from the current byte count. Should be called
* in finish(), before any padding is added. This basically does a
* snapshot of the bitcount value before the padding.
*/
void getBitCount()
{
nrBitsLo = (nrBytesLo << 3) & 0xffffffff;
nrBitsHi = (nrBytesHi << 3) | ((nrBytesLo >> 29) & 7);
}
/**
* Common code for appending the 64-bit bitcount to the end of the
* message, after the padding. Should be called after padding, just
* before outputting the result.
*/
void appendBitCount()
{
update((unsigned char)((nrBitsHi>>24) & 0xff));
update((unsigned char)((nrBitsHi>>16) & 0xff));
update((unsigned char)((nrBitsHi>> 8) & 0xff));
update((unsigned char)((nrBitsHi ) & 0xff));
update((unsigned char)((nrBitsLo>>24) & 0xff));
update((unsigned char)((nrBitsLo>>16) & 0xff));
update((unsigned char)((nrBitsLo>> 8) & 0xff));
update((unsigned char)((nrBitsLo ) & 0xff));
}
//32/64 portable byte and bit counts
unsigned long nrBytesHi;
unsigned long nrBytesLo;
unsigned long nrBitsHi;
unsigned long nrBitsLo;
};
/**
* SHA-1,
* Section 6.1, SECURE HASH STANDARD
* Federal Information Processing Standards Publication 180-2
* http://csrc.nist.gov/publications/drafts/fips_180-3/draft_fips-180-3_June-08-2007.pdf
*/
class Sha1 : public Digest
{
public:
/**
* Constructor
*/
Sha1()
{ hashType = HASH_SHA1; reset(); }
/**
* Destructor
*/
virtual ~Sha1()
{ reset(); }
/**
* Overloaded from Digest
*/
virtual void reset();
/**
* Overloaded from Digest
*/
virtual std::vector<unsigned char> finish();
protected:
/**
* Overloaded from Digest
*/
virtual void update(unsigned char val);
/**
* Overloaded from Digest
*/
virtual void transform();
private:
unsigned long hashBuf[5];
unsigned long inBuf[80];
int longNr;
int byteNr;
unsigned long inb[4];
};
/**
* SHA-224,
* Section 6.1, SECURE HASH STANDARD
* Federal Information Processing Standards Publication 180-2
* http://csrc.nist.gov/publications/drafts/fips_180-3/draft_fips-180-3_June-08-2007.pdf
*/
class Sha224 : public Digest
{
public:
/**
* Constructor
*/
Sha224()
{ hashType = HASH_SHA224; reset(); }
/**
* Destructor
*/
virtual ~Sha224()
{ reset(); }
/**
* Overloaded from Digest
*/
virtual void reset();
/**
* Overloaded from Digest
*/
virtual std::vector<unsigned char> finish();
protected:
/**
* Overloaded from Digest
*/
virtual void update(unsigned char val);
/**
* Overloaded from Digest
*/
virtual void transform();
private:
unsigned long hashBuf[8];
unsigned long inBuf[64];
int longNr;
int byteNr;
unsigned long inb[4];
};
/**
* SHA-256,
* Section 6.1, SECURE HASH STANDARD
* Federal Information Processing Standards Publication 180-2
* http://csrc.nist.gov/publications/drafts/fips_180-3/draft_fips-180-3_June-08-2007.pdf
*/
class Sha256 : public Digest
{
public:
/**
* Constructor
*/
Sha256()
{ hashType = HASH_SHA256; reset(); }
/**
* Destructor
*/
virtual ~Sha256()
{ reset(); }
/**
* Overloaded from Digest
*/
virtual void reset();
/**
* Overloaded from Digest
*/
virtual std::vector<unsigned char> finish();
protected:
/**
* Overloaded from Digest
*/
virtual void update(unsigned char val);
/**
* Overloaded from Digest
*/
virtual void transform();
private:
unsigned long hashBuf[8];
unsigned long inBuf[64];
int longNr;
int byteNr;
unsigned long inb[4];
};
/**
* SHA-384,
* Section 6.1, SECURE HASH STANDARD
* Federal Information Processing Standards Publication 180-2
* http://csrc.nist.gov/publications/drafts/fips_180-3/draft_fips-180-3_June-08-2007.pdf
*/
class Sha384 : public Digest
{
public:
/**
* Constructor
*/
Sha384()
{ hashType = HASH_SHA384; reset(); }
/**
* Destructor
*/
virtual ~Sha384()
{ reset(); }
/**
* Overloaded from Digest
*/
virtual void reset();
/**
* Overloaded from Digest
*/
virtual std::vector<unsigned char> finish();
protected:
/**
* Overloaded from Digest
*/
virtual void update(unsigned char val);
/**
* Overloaded from Digest
*/
virtual void transform();
private:
unsigned long long hashBuf[8];
unsigned long long inBuf[80];
int longNr;
int byteNr;
unsigned long long inb[8];
};
/**
* SHA-512,
* Section 6.1, SECURE HASH STANDARD
* Federal Information Processing Standards Publication 180-2
* http://csrc.nist.gov/publications/drafts/fips_180-3/draft_fips-180-3_June-08-2007.pdf
*/
class Sha512 : public Digest
{
public:
/**
* Constructor
*/
Sha512()
{ hashType = HASH_SHA512; reset(); }
/**
* Destructor
*/
virtual ~Sha512()
{ reset(); }
/**
* Overloaded from Digest
*/
virtual void reset();
/**
* Overloaded from Digest
*/
virtual std::vector<unsigned char> finish();
protected:
/**
* Overloaded from Digest
*/
virtual void update(unsigned char val);
/**
* Overloaded from Digest
*/
virtual void transform();
private:
unsigned long long hashBuf[8];
unsigned long long inBuf[80];
int longNr;
int byteNr;
unsigned long long inb[8];
};
/**
* IETF RFC 1321, MD5 Specification
* http://www.ietf.org/rfc/rfc1321.txt
*/
class Md5 : public Digest
{
public:
/**
* Constructor
*/
Md5()
{ hashType = HASH_MD5; reset(); }
/**
* Destructor
*/
virtual ~Md5()
{ reset(); }
/**
* Overloaded from Digest
*/
virtual void reset();
/**
* Overloaded from Digest
*/
virtual std::vector<unsigned char> finish();
protected:
/**
* Overloaded from Digest
*/
virtual void update(unsigned char val);
/**
* Overloaded from Digest
*/
virtual void transform();
private:
unsigned long hashBuf[4];
unsigned long inBuf[16];
unsigned long inb[4]; // Buffer for input bytes as longs
int byteNr; // which byte in long
int longNr; // which long in 16-long buffer
};
#endif /* __DIGEST_H__ */
|