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
|
/*
* Copyright (c) 2010 .SE (The Internet Infrastructure Foundation)
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
* GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
* IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
* IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/*****************************************************************************
BotanHashAlgorithm.cpp
Base class for Botan hash algorithm classes
*****************************************************************************/
#include "config.h"
#include "BotanHashAlgorithm.h"
#include <botan/filters.h>
// Base constructor
BotanHashAlgorithm::BotanHashAlgorithm()
{
hash = NULL;
}
// Destructor
BotanHashAlgorithm::~BotanHashAlgorithm()
{
delete hash;
}
// Hashing functions
bool BotanHashAlgorithm::hashInit()
{
if (!HashAlgorithm::hashInit())
{
return false;
}
// Initialize digesting
try
{
if (hash == NULL)
{
hash = getHash();
}
else
{
hash->clear();
}
}
catch (...)
{
ERROR_MSG("Failed to initialize the digesting token");
ByteString dummy;
HashAlgorithm::hashFinal(dummy);
return false;
}
return true;
}
bool BotanHashAlgorithm::hashUpdate(const ByteString& data)
{
if (!HashAlgorithm::hashUpdate(data))
{
return false;
}
// Continue digesting
try
{
if (data.size() != 0)
{
hash->update(data.const_byte_str(), data.size());
}
}
catch (...)
{
ERROR_MSG("Failed to buffer data");
ByteString dummy;
HashAlgorithm::hashFinal(dummy);
return false;
}
return true;
}
bool BotanHashAlgorithm::hashFinal(ByteString& hashedData)
{
if (!HashAlgorithm::hashFinal(hashedData))
{
return false;
}
// Resize
hashedData.resize(hash->output_length());
// Read the digest
try
{
hash->final(&hashedData[0]);
}
catch (...)
{
ERROR_MSG("Failed to digest the data");
return false;
}
return true;
}
|
