blob: 32ae26258be3063c846b28a39adf5be150a1a35f (
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
|
/*
* Tiger
* (C) 1999-2007 Jack Lloyd
*
* Botan is released under the Simplified BSD License (see license.txt)
*/
#ifndef BOTAN_TIGER_H__
#define BOTAN_TIGER_H__
#include <botan/mdx_hash.h>
namespace Botan {
/**
* Tiger
*/
class BOTAN_DLL Tiger final : public MDx_HashFunction
{
public:
std::string name() const override;
size_t output_length() const override { return m_hash_len; }
HashFunction* clone() const override
{
return new Tiger(output_length(), m_passes);
}
void clear() override;
/**
* @param out_size specifies the output length; can be 16, 20, or 24
* @param passes to make in the algorithm
*/
Tiger(size_t out_size = 24, size_t passes = 3);
private:
void compress_n(const uint8_t[], size_t block) override;
void copy_out(uint8_t[]) override;
static void pass(uint64_t& A, uint64_t& B, uint64_t& C,
const secure_vector<uint64_t>& M,
uint8_t mul);
static const uint64_t SBOX1[256];
static const uint64_t SBOX2[256];
static const uint64_t SBOX3[256];
static const uint64_t SBOX4[256];
secure_vector<uint64_t> m_X, m_digest;
const size_t m_hash_len, m_passes;
};
}
#endif
|
