7#include <botan/argon2.h>
9#include <botan/exceptn.h>
10#include <botan/hash.h>
11#include <botan/mem_ops.h>
12#include <botan/internal/fmt.h>
13#include <botan/internal/loadstor.h>
14#include <botan/internal/mem_utils.h>
15#include <botan/internal/rotate.h>
18#if defined(BOTAN_HAS_THREAD_UTILS)
19 #include <botan/internal/thread_pool.h>
22#if defined(BOTAN_HAS_CPUID)
23 #include <botan/internal/cpuid.h>
30const size_t SYNC_POINTS = 4;
32void argon2_H0(uint8_t H0[64],
49 blake2b.update_le(
static_cast<uint32_t
>(p));
50 blake2b.update_le(
static_cast<uint32_t
>(output_len));
51 blake2b.update_le(
static_cast<uint32_t
>(M));
52 blake2b.update_le(
static_cast<uint32_t
>(t));
53 blake2b.update_le(
static_cast<uint32_t
>(v));
54 blake2b.update_le(
static_cast<uint32_t
>(y));
56 blake2b.update_le(
static_cast<uint32_t
>(password_len));
59 blake2b.update_le(
static_cast<uint32_t
>(salt_len));
60 blake2b.update(salt, salt_len);
62 blake2b.update_le(
static_cast<uint32_t
>(key_len));
63 blake2b.update(key, key_len);
65 blake2b.update_le(
static_cast<uint32_t
>(ad_len));
66 blake2b.update(ad, ad_len);
71void extract_key(uint8_t output[],
size_t output_len,
const secure_vector<uint64_t>& B,
size_t memory,
size_t threads) {
72 const size_t lanes = memory / threads;
74 uint64_t sum[128] = {0};
76 for(
size_t lane = 0; lane != threads; ++lane) {
77 const size_t start = 128 * (lane * lanes + lanes - 1);
78 const size_t end = 128 * (lane * lanes + lanes);
80 for(
size_t j = start; j != end; ++j) {
85 if(output_len <= 64) {
87 blake2b->update_le(
static_cast<uint32_t
>(output_len));
88 for(
size_t i = 0; i != 128; ++i) {
89 blake2b->update_le(sum[i]);
91 blake2b->final(output);
96 blake2b->update_le(
static_cast<uint32_t
>(output_len));
97 for(
size_t i = 0; i != 128; ++i) {
98 blake2b->update_le(sum[i]);
100 blake2b->final(std::span{T});
102 while(output_len > 64) {
107 if(output_len > 64) {
109 blake2b->final(std::span{T});
113 if(output_len == 64) {
115 blake2b->final(output);
118 blake2b_f->update(T);
119 blake2b_f->final(output);
128 for(
size_t i = 0; i != threads; ++i) {
129 const size_t B_off = i * (memory / threads);
133 for(
size_t j = 0; j != 2; ++j) {
136 blake2b.update_le(
static_cast<uint32_t
>(1024));
137 blake2b.update(H0, 64);
138 blake2b.update_le(
static_cast<uint32_t
>(j));
139 blake2b.update_le(
static_cast<uint32_t
>(i));
142 for(
size_t k = 0; k != 30; ++k) {
143 load_le(&B[128 * (B_off + j) + 4 * k], T, 32 / 8);
144 blake2b.update(T, 64);
148 load_le(&B[128 * (B_off + j) + 4 * 30], T, 64 / 8);
154 A += B + (
static_cast<uint64_t
>(2) *
static_cast<uint32_t
>(A)) *
static_cast<uint32_t
>(B);
157 C += D + (
static_cast<uint64_t
>(2) *
static_cast<uint32_t
>(C)) *
static_cast<uint32_t
>(D);
160 A += B + (
static_cast<uint64_t
>(2) *
static_cast<uint32_t
>(A)) *
static_cast<uint32_t
>(B);
163 C += D + (
static_cast<uint64_t
>(2) *
static_cast<uint32_t
>(C)) *
static_cast<uint32_t
>(D);
170#if defined(BOTAN_HAS_ARGON2_AVX2)
172 return Argon2::blamka_avx2(N, T);
176#if defined(BOTAN_HAS_ARGON2_SSSE3)
178 return Argon2::blamka_ssse3(N, T);
184 for(
size_t i = 0; i != 128; i += 16) {
185 blamka_G(T[i + 0], T[i + 4], T[i + 8], T[i + 12]);
186 blamka_G(T[i + 1], T[i + 5], T[i + 9], T[i + 13]);
187 blamka_G(T[i + 2], T[i + 6], T[i + 10], T[i + 14]);
188 blamka_G(T[i + 3], T[i + 7], T[i + 11], T[i + 15]);
190 blamka_G(T[i + 0], T[i + 5], T[i + 10], T[i + 15]);
191 blamka_G(T[i + 1], T[i + 6], T[i + 11], T[i + 12]);
192 blamka_G(T[i + 2], T[i + 7], T[i + 8], T[i + 13]);
193 blamka_G(T[i + 3], T[i + 4], T[i + 9], T[i + 14]);
196 for(
size_t i = 0; i != 128 / 8; i += 2) {
197 blamka_G(T[i + 0], T[i + 32], T[i + 64], T[i + 96]);
198 blamka_G(T[i + 1], T[i + 33], T[i + 65], T[i + 97]);
199 blamka_G(T[i + 16], T[i + 48], T[i + 80], T[i + 112]);
200 blamka_G(T[i + 17], T[i + 49], T[i + 81], T[i + 113]);
202 blamka_G(T[i + 0], T[i + 33], T[i + 80], T[i + 113]);
203 blamka_G(T[i + 1], T[i + 48], T[i + 81], T[i + 96]);
204 blamka_G(T[i + 16], T[i + 49], T[i + 64], T[i + 97]);
205 blamka_G(T[i + 17], T[i + 32], T[i + 65], T[i + 112]);
208 for(
size_t i = 0; i != 128; ++i) {
215void gen_2i_addresses(uint64_t T[128],
234 for(
size_t r = 0; r != 2; ++r) {
240 uint64_t random,
size_t lanes,
size_t segments,
size_t threads,
size_t n,
size_t slice,
size_t lane,
size_t index) {
241 size_t ref_lane =
static_cast<uint32_t
>(random >> 32) % threads;
243 if(n == 0 && slice == 0) {
247 size_t m = 3 * segments;
248 size_t s = ((slice + 1) % 4) * segments;
250 if(lane == ref_lane) {
255 m = slice * segments;
257 if(slice == 0 || lane == ref_lane) {
262 if(index == 0 || lane == ref_lane) {
266 uint64_t p =
static_cast<uint32_t
>(random);
270 return static_cast<uint32_t
>(ref_lane * lanes + (s + m - (p + 1)) % lanes);
285 if(n == 0 && slice == 0) {
289 const bool use_2i = mode == 1 || (mode == 2 && n == 0 && slice < SYNC_POINTS / 2);
291 uint64_t addresses[128];
292 size_t address_counter = 1;
295 gen_2i_addresses(T, addresses, n, lane, slice, memory, time, mode, address_counter);
298 while(index < segments) {
299 const size_t offset = lane * lanes + slice * segments + index;
301 size_t prev = offset - 1;
302 if(index == 0 && slice == 0) {
306 if(use_2i && index > 0 && index % 128 == 0) {
307 address_counter += 1;
308 gen_2i_addresses(T, addresses, n, lane, slice, memory, time, mode, address_counter);
311 const uint64_t random = use_2i ? addresses[index % 128] : B.at(128 * prev);
312 const size_t new_offset = index_alpha(random, lanes, segments, threads, n, slice, lane, index);
315 for(
size_t i = 0; i != 128; ++i) {
316 N[i] = B[128 * prev + i] ^ B[128 * new_offset + i];
321 for(
size_t i = 0; i != 128; ++i) {
322 B[128 * offset + i] ^= N[i];
330 const size_t lanes = memory / threads;
331 const size_t segments = lanes / SYNC_POINTS;
333#if defined(BOTAN_HAS_THREAD_UTILS)
337 for(
size_t n = 0; n != t; ++n) {
338 for(
size_t slice = 0; slice != SYNC_POINTS; ++slice) {
339 std::vector<std::future<void>> fut_results;
340 fut_results.reserve(threads);
342 for(
size_t lane = 0; lane != threads; ++lane) {
343 fut_results.push_back(thread_pool.run(
344 process_block, std::ref(B), n, slice, lane, lanes, segments, threads, mode, memory, t));
347 for(
auto& fut : fut_results) {
357 for(
size_t n = 0; n != t; ++n) {
358 for(
size_t slice = 0; slice != SYNC_POINTS; ++slice) {
359 for(
size_t lane = 0; lane != threads; ++lane) {
360 process_block(B, n, slice, lane, lanes, segments, threads, mode, memory, t);
368void Argon2::argon2(uint8_t output[],
370 const char* password,
372 const uint8_t salt[],
377 size_t ad_len)
const {
378 BOTAN_ARG_CHECK(output_len >= 4 && output_len <= std::numeric_limits<uint32_t>::max(),
379 "Invalid Argon2 output length");
380 BOTAN_ARG_CHECK(password_len <= std::numeric_limits<uint32_t>::max(),
"Invalid Argon2 password length");
381 BOTAN_ARG_CHECK(salt_len <= std::numeric_limits<uint32_t>::max(),
"Invalid Argon2 salt length");
382 BOTAN_ARG_CHECK(key_len <= std::numeric_limits<uint32_t>::max(),
"Invalid Argon2 key length");
383 BOTAN_ARG_CHECK(ad_len <= std::numeric_limits<uint32_t>::max(),
"Invalid Argon2 ad length");
387 uint8_t H0[64] = {0};
404 const size_t memory = (m_M / (SYNC_POINTS * m_p)) * (SYNC_POINTS * m_p);
408 init_blocks(B, *blake2, H0, memory, m_p);
409 process_blocks(B, m_t, memory, m_p, m_family);
412 extract_key(output, output_len, B, memory, m_p);
#define BOTAN_ASSERT_NOMSG(expr)
#define BOTAN_ARG_CHECK(expr, msg)
static void blamka(uint64_t N[128], uint64_t T[128])
static bool has(CPUID::Feature feat)
static std::unique_ptr< HashFunction > create_or_throw(std::string_view algo_spec, std::string_view provider="")
static Thread_Pool & global_instance()
#define BOTAN_FORCE_INLINE
std::span< const uint8_t > as_span_of_bytes(const char *s, size_t len)
constexpr void copy_mem(T *out, const T *in, size_t n)
std::string fmt(std::string_view format, const T &... args)
BOTAN_FORCE_INLINE constexpr T rotr(T input)
constexpr auto load_le(ParamTs &&... params)
std::vector< T, secure_allocator< T > > secure_vector
constexpr void clear_mem(T *ptr, size_t n)