blob: 6a0d42dee9017b37f3482cfc476bba9846293476 (
plain)
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
|
/*
* Hash Algorithms Lookup
* (C) 1999-2007 Jack Lloyd
*
* Distributed under the terms of the Botan license
*/
#include <botan/def_eng.h>
#include <botan/scan_name.h>
#include <botan/algo_factory.h>
#include <memory>
#if defined(BOTAN_HAS_ADLER32)
#include <botan/adler32.h>
#endif
#if defined(BOTAN_HAS_CRC24)
#include <botan/crc24.h>
#endif
#if defined(BOTAN_HAS_CRC32)
#include <botan/crc32.h>
#endif
#if defined(BOTAN_HAS_FORK_256)
#include <botan/fork256.h>
#endif
#if defined(BOTAN_HAS_HAS_160)
#include <botan/has160.h>
#endif
#if defined(BOTAN_HAS_MD2)
#include <botan/md2.h>
#endif
#if defined(BOTAN_HAS_MD4)
#include <botan/md4.h>
#endif
#if defined(BOTAN_HAS_MD5)
#include <botan/md5.h>
#endif
#if defined(BOTAN_HAS_RIPEMD_128)
#include <botan/rmd128.h>
#endif
#if defined(BOTAN_HAS_RIPEMD_160)
#include <botan/rmd160.h>
#endif
#if defined(BOTAN_HAS_SHA1)
#include <botan/sha160.h>
#endif
#if defined(BOTAN_HAS_SHA2)
#include <botan/sha2_32.h>
#include <botan/sha2_64.h>
#endif
#if defined(BOTAN_HAS_TIGER)
#include <botan/tiger.h>
#endif
#if defined(BOTAN_HAS_WHIRLPOOL)
#include <botan/whrlpool.h>
#endif
#if defined(BOTAN_HAS_PARALLEL_HASH)
#include <botan/par_hash.h>
#endif
namespace Botan {
/*
* Look for an algorithm with this name
*/
HashFunction*
Default_Engine::find_hash(const SCAN_Name& request,
Algorithm_Factory& af) const
{
#if defined(BOTAN_HAS_ADLER32)
if(request.algo_name() == "Adler32")
return new Adler32;
#endif
#if defined(BOTAN_HAS_CRC24)
if(request.algo_name() == "CRC24")
return new CRC24;
#endif
#if defined(BOTAN_HAS_CRC32)
if(request.algo_name() == "CRC32")
return new CRC32;
#endif
#if defined(BOTAN_HAS_FORK_256)
if(request.algo_name() == "FORK-256")
return new FORK_256;
#endif
#if defined(BOTAN_HAS_HAS_160)
if(request.algo_name() == "HAS-160")
return new HAS_160;
#endif
#if defined(BOTAN_HAS_MD2)
if(request.algo_name() == "MD2")
return new MD2;
#endif
#if defined(BOTAN_HAS_MD4)
if(request.algo_name() == "MD4")
return new MD4;
#endif
#if defined(BOTAN_HAS_MD5)
if(request.algo_name() == "MD5")
return new MD5;
#endif
#if defined(BOTAN_HAS_RIPEMD_128)
if(request.algo_name() == "RIPEMD-128")
return new RIPEMD_128;
#endif
#if defined(BOTAN_HAS_RIPEMD_160)
if(request.algo_name() == "RIPEMD-160")
return new RIPEMD_160;
#endif
#if defined(BOTAN_HAS_SHA1)
if(request.algo_name() == "SHA-160")
return new SHA_160;
#endif
#if defined(BOTAN_HAS_SHA2)
if(request.algo_name() == "SHA-224")
return new SHA_224;
if(request.algo_name() == "SHA-256")
return new SHA_256;
if(request.algo_name() == "SHA-384")
return new SHA_384;
if(request.algo_name() == "SHA-512")
return new SHA_512;
#endif
#if defined(BOTAN_HAS_TIGER)
if(request.algo_name() == "Tiger")
return new Tiger(request.arg_as_u32bit(0, 24), // hash output
request.arg_as_u32bit(1, 3)); // # passes
#endif
#if defined(BOTAN_HAS_WHIRLPOOL)
if(request.algo_name() == "Whirlpool")
return new Whirlpool;
#endif
#if defined(BOTAN_HAS_PARALLEL_HASH)
if(request.algo_name() == "Parallel")
{
std::vector<const HashFunction*> hash_prototypes;
/* First pass, just get the prototypes (no memory allocation). Then
if all were found, replace each prototype with a newly created clone
*/
for(size_t i = 0; i != request.arg_count(); ++i)
{
const HashFunction* hash = af.prototype_hash_function(request.arg(i));
if(!hash)
return 0;
hash_prototypes.push_back(hash);
}
std::vector<HashFunction*> hashes;
for(size_t i = 0; i != hash_prototypes.size(); ++i)
hashes.push_back(hash_prototypes[i]->clone());
return new Parallel(hashes);
}
#endif
return 0;
}
}
|
