Samuel Lucas

Thanks both, I'll open an issue or discussion in a .NET repo and link them here.

Sorry for my slow reply. Thank you for bringing these things up as they do need to be corrected. I believe I just copied that figure from the libsodium docs.

I agree that a 256-bit random salt is unnecessary. That was primarily motivated by [Latacora](https://www.latacora.com/blog/2018/04/03/cryptographic-right-answers/) and libsodium's [scrypt implementation](https://doc.libsodium.org/advanced/scrypt). However, a 256-bit salt makes sense for deterministic salts where you...

Thanks for investigating. Sorry, I should've mentioned those results were with a single lane. Glad it's led to that discovery. I found the performance to be much better on my...

I'm glad you find the guidelines useful. However, there are various inaccuracies and changes I'd like to make, like switching to a pros/cons list for each algorithm rather than trying...

I'd recommend sticking with Argon2, at least for the time being. It's among the best we have in practice but not perfect. It should be stronger and significantly faster than...

> Well, I assume that the original paper describing the algorithm does fit this bill, right? Nope because they didn't take the time to properly specify the algorithm. It leaves...

> Besides not specifying which hash algorithm to use, I don't see any meaningful missing details. Could you point to some? The paper pseudocode doesn't define things like `ints_to_block()`, the...

> [I find all of the issues a bit like nit-picking...] In that case, I'm going to unsubscribe from this conversation as there's no point going around in circles. I...

I also dislike the pattern formatting. [This](https://neilmadden.blog/2018/11/26/public-key-authenticated-encryption-and-why-you-want-it-part-ii/) blog post series is very good for the non-interactive patterns, although the website template has changed, which makes it less readable. [Noise Explorer](https://noiseexplorer.com/)...