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
|
/*
* Lion
* (C) 1999-2007,2014 Jack Lloyd
*
* Botan is released under the Simplified BSD License (see license.txt)
*/
#include <botan/internal/block_utils.h>
#include <botan/lion.h>
#include <botan/parsing.h>
namespace Botan {
namespace {
Lion* make_lion(const BlockCipher::Spec& spec)
{
if(spec.arg_count_between(2, 3))
{
std::unique_ptr<HashFunction> hash(Algo_Registry<HashFunction>::global_registry().make(spec.arg(0)));
std::unique_ptr<StreamCipher> stream(Algo_Registry<StreamCipher>::global_registry().make(spec.arg(1)));
if(hash && stream)
{
const size_t block_size = spec.arg_as_integer(2, 1024);
return new Lion(hash.release(), stream.release(), block_size);
}
}
return nullptr;
}
}
BOTAN_REGISTER_NAMED_T(BlockCipher, "Lion", Lion, make_lion);
/*
* Lion Encryption
*/
void Lion::encrypt_n(const byte in[], byte out[], size_t blocks) const
{
const size_t LEFT_SIZE = left_size();
const size_t RIGHT_SIZE = right_size();
secure_vector<byte> buffer_vec(LEFT_SIZE);
byte* buffer = &buffer_vec[0];
for(size_t i = 0; i != blocks; ++i)
{
xor_buf(buffer, in, &m_key1[0], LEFT_SIZE);
m_cipher->set_key(buffer, LEFT_SIZE);
m_cipher->cipher(in + LEFT_SIZE, out + LEFT_SIZE, RIGHT_SIZE);
m_hash->update(out + LEFT_SIZE, RIGHT_SIZE);
m_hash->final(buffer);
xor_buf(out, in, buffer, LEFT_SIZE);
xor_buf(buffer, out, &m_key2[0], LEFT_SIZE);
m_cipher->set_key(buffer, LEFT_SIZE);
m_cipher->cipher1(out + LEFT_SIZE, RIGHT_SIZE);
in += m_block_size;
out += m_block_size;
}
}
/*
* Lion Decryption
*/
void Lion::decrypt_n(const byte in[], byte out[], size_t blocks) const
{
const size_t LEFT_SIZE = left_size();
const size_t RIGHT_SIZE = right_size();
secure_vector<byte> buffer_vec(LEFT_SIZE);
byte* buffer = &buffer_vec[0];
for(size_t i = 0; i != blocks; ++i)
{
xor_buf(buffer, in, &m_key2[0], LEFT_SIZE);
m_cipher->set_key(buffer, LEFT_SIZE);
m_cipher->cipher(in + LEFT_SIZE, out + LEFT_SIZE, RIGHT_SIZE);
m_hash->update(out + LEFT_SIZE, RIGHT_SIZE);
m_hash->final(buffer);
xor_buf(out, in, buffer, LEFT_SIZE);
xor_buf(buffer, out, &m_key1[0], LEFT_SIZE);
m_cipher->set_key(buffer, LEFT_SIZE);
m_cipher->cipher1(out + LEFT_SIZE, RIGHT_SIZE);
in += m_block_size;
out += m_block_size;
}
}
/*
* Lion Key Schedule
*/
void Lion::key_schedule(const byte key[], size_t length)
{
clear();
const size_t half = length / 2;
copy_mem(&m_key1[0], key, half);
copy_mem(&m_key2[0], key + half, half);
}
/*
* Return the name of this type
*/
std::string Lion::name() const
{
return "Lion(" + m_hash->name() + "," +
m_cipher->name() + "," +
std::to_string(block_size()) + ")";
}
/*
* Return a clone of this object
*/
BlockCipher* Lion::clone() const
{
return new Lion(m_hash->clone(), m_cipher->clone(), block_size());
}
/*
* Clear memory of sensitive data
*/
void Lion::clear()
{
zeroise(m_key1);
zeroise(m_key2);
m_hash->clear();
m_cipher->clear();
}
/*
* Lion Constructor
*/
Lion::Lion(HashFunction* hash, StreamCipher* cipher, size_t block_size) :
m_block_size(std::max<size_t>(2*hash->output_length() + 1, block_size)),
m_hash(hash),
m_cipher(cipher)
{
if(2*left_size() + 1 > m_block_size)
throw Invalid_Argument(name() + ": Chosen block size is too small");
if(!m_cipher->valid_keylength(left_size()))
throw Invalid_Argument(name() + ": This stream/hash combo is invalid");
m_key1.resize(left_size());
m_key2.resize(left_size());
}
}
|
