Botan 2.19.3
Crypto and TLS for C&
|
#include <bcrypt_pbkdf.h>
Public Member Functions | |
Bcrypt_PBKDF (const Bcrypt_PBKDF &other)=default | |
Bcrypt_PBKDF (size_t iterations) | |
void | derive_key (uint8_t out[], size_t out_len, const char *password, size_t password_len, const uint8_t salt[], size_t salt_len) const override |
size_t | iterations () const override |
size_t | memory_param () const override |
Bcrypt_PBKDF & | operator= (const Bcrypt_PBKDF &)=default |
size_t | parallelism () const override |
std::string | to_string () const override |
size_t | total_memory_usage () const override |
Bcrypt-PBKDF key derivation function
Definition at line 19 of file bcrypt_pbkdf.h.
|
inline |
Definition at line 22 of file bcrypt_pbkdf.h.
|
default |
|
overridevirtual |
Derive a new key under the current Bcrypt-PBKDF parameter set
Implements Botan::PasswordHash.
Definition at line 15 of file bcrypt_pbkdf.cpp.
References Botan::bcrypt_pbkdf(), and salt_len.
|
inlineoverridevirtual |
Most password hashes have some notion of iterations.
Implements Botan::PasswordHash.
Definition at line 36 of file bcrypt_pbkdf.h.
|
inlineoverridevirtual |
Some password hashing algorithms have a parameter which controls how much memory is used. If not supported by some algorithm, returns 0.
Reimplemented from Botan::PasswordHash.
Definition at line 40 of file bcrypt_pbkdf.h.
|
default |
|
inlineoverridevirtual |
Some password hashing algorithms have a parallelism parameter. If the algorithm does not support this notion, then the function returns zero. This allows distinguishing between a password hash which just does not support parallel operation, vs one that does support parallel operation but which has been configured to use a single lane.
Reimplemented from Botan::PasswordHash.
Definition at line 38 of file bcrypt_pbkdf.h.
|
overridevirtual |
Implements Botan::PasswordHash.
Definition at line 25 of file bcrypt_pbkdf.cpp.
|
inlineoverridevirtual |
Returns an estimate of the total memory usage required to perform this key derivation.
If this algorithm uses a small and constant amount of memory, with no effort made towards being memory hard, this function returns 0.
Reimplemented from Botan::PasswordHash.
Definition at line 42 of file bcrypt_pbkdf.h.