Botan 2.19.3
Crypto and TLS for C&
|
#include <argon2.h>
Public Member Functions | |
Argon2 (const Argon2 &other)=default | |
Argon2 (uint8_t family, size_t M, size_t t, size_t p) | |
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 | M () const |
size_t | memory_param () const override |
Argon2 & | operator= (const Argon2 &)=default |
size_t | p () const |
size_t | parallelism () const override |
size_t | t () const |
std::string | to_string () const override |
size_t | total_memory_usage () const override |
Botan::Argon2::Argon2 | ( | uint8_t | family, |
size_t | M, | ||
size_t | t, | ||
size_t | p | ||
) |
Definition at line 14 of file argon2pwhash.cpp.
References BOTAN_ARG_CHECK.
|
default |
|
overridevirtual |
Derive a new key under the current Argon2 parameter set
Implements Botan::PasswordHash.
Definition at line 25 of file argon2pwhash.cpp.
References Botan::argon2(), and salt_len.
|
inlineoverridevirtual |
Most password hashes have some notion of iterations.
Implements Botan::PasswordHash.
Definition at line 42 of file argon2.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 46 of file argon2.h.
|
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 44 of file argon2.h.
|
overridevirtual |
Implements Botan::PasswordHash.
Definition at line 56 of file argon2pwhash.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 48 of file argon2.h.