blob: 0f35685d48e83bf8f36d1b6d41eca0d4b23beb48 (
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
|
/*
* Hash Function Base Class
* (C) 1999-2008 Jack Lloyd
*
* Botan is released under the Simplified BSD License (see license.txt)
*/
#ifndef BOTAN_HASH_FUNCTION_BASE_CLASS_H__
#define BOTAN_HASH_FUNCTION_BASE_CLASS_H__
#include <botan/scan_name.h>
#include <botan/buf_comp.h>
#include <string>
namespace Botan {
/**
* This class represents hash function (message digest) objects
*/
class BOTAN_DLL HashFunction : public Buffered_Computation
{
public:
typedef SCAN_Name Spec;
/**
* Create an instance based on a name
* Will return a null pointer if the algo/provider combination cannot
* be found. If provider is empty then best available is chosen.
*/
static std::unique_ptr<HashFunction> create(const std::string& algo_spec,
const std::string& provider = "");
/**
* Returns the list of available providers for this algorithm, empty if not available
*/
static std::vector<std::string> providers(const std::string& algo_spec);
/**
* @return new object representing the same algorithm as *this
*/
virtual HashFunction* clone() const = 0;
/**
* @return provider information about this implementation. Default is "base",
* might also return "sse2", "avx2", "openssl", or some other arbitrary string.
* The return value is guaranteed to point to a string literal constant.
*/
virtual const char* provider() const { return "base"; }
HashFunction();
virtual ~HashFunction();
virtual void clear() = 0;
virtual std::string name() const = 0;
/**
* @return hash block size as defined for this algorithm
*/
virtual size_t hash_block_size() const { return 0; }
};
}
#endif
|
