Ranieri Althoff

Right, it seems that for the very small set size we usually have the overhead of hashing is way larger than the added complexity. I wonder if using a [`boost::small_vector`](https://live.boost.org/doc/libs/1_58_0/doc/html/boost/container/small_vector.html)...

Please fix the builds

It seems that [vcpkg already does that](https://github.com/microsoft/vcpkg/blob/d9af3f55860791057b19d6d16f86a0605d99782e/ports/fmt/fix-pass-utf-8-only-if-the-compiler-is-MSVC-at-build.patch), but half assed like everything else Microsoft touches I can't install Visual Studio

Huh. How come it worked 😆

@tniessen how to handle the different parameters used by each KDF? At some point you will need separate functions to set the parameter list, but fetching the KDF and applying...

> But doesnt argon2 give different results based on parallelism? If so, doesnt this mean that if somebody uses argon2 for his product he is forced to not use parallelism....

Added parallelism support by creating a new OpenSSL context for each hash. This is needed for the async mode, otherwise there is a race condition when one job finishes and...

Good news: [OpenSSL 3.2 has finally been released](https://www.openssl.org/blog/blog/2023/11/23/OpenSSL32/) Bad news: [there are incompatibilities with quictls' fork](https://github.com/quictls/quictls/issues/14) that won't be solved so soon.

OpenSSL has been launching LTS releases roughly every 3 years (2015, 2018, 2021) so it may be out soon, hopefully I'm gonna rebase this PR soon

I will add KDF to ncrypto and then implement Argon2 on top of that when OpenSSL releases a new LTS