blob: e5dda579f3346c7a11a6fd0134c7b5a507ac7612 (
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
|
/*
* PBKDF1
* (C) 1999-2007 Jack Lloyd
*
* Botan is released under the Simplified BSD License (see license.txt)
*/
#include <botan/internal/pbkdf_utils.h>
#include <botan/pbkdf1.h>
#include <botan/exceptn.h>
namespace Botan {
BOTAN_REGISTER_PBKDF_1HASH(PKCS5_PBKDF1, "PBKDF1")
/*
* Return a PKCS#5 PBKDF1 derived key
*/
std::pair<size_t, OctetString>
PKCS5_PBKDF1::key_derivation(size_t key_len,
const std::string& passphrase,
const byte salt[], size_t salt_len,
size_t iterations,
std::chrono::milliseconds msec) const
{
if(key_len > hash->output_length())
throw Invalid_Argument("PKCS5_PBKDF1: Requested output length too long");
hash->update(passphrase);
hash->update(salt, salt_len);
secure_vector<byte> key = hash->final();
const auto start = std::chrono::high_resolution_clock::now();
size_t iterations_performed = 1;
while(true)
{
if(iterations == 0)
{
if(iterations_performed % 10000 == 0)
{
auto time_taken = std::chrono::high_resolution_clock::now() - start;
auto msec_taken = std::chrono::duration_cast<std::chrono::milliseconds>(time_taken);
if(msec_taken > msec)
break;
}
}
else if(iterations_performed == iterations)
break;
hash->update(key);
hash->final(&key[0]);
++iterations_performed;
}
return std::make_pair(iterations_performed,
OctetString(&key[0], std::min(key_len, key.size())));
}
}
|
