A memory-bound graph-theoretic proof-of-work system written in Rust
-
Updated
Oct 17, 2019 - Rust
A memory-bound graph-theoretic proof-of-work system written in Rust
A .NET implementation of scrypt.
Strong encryption tool, aiming for 512 bits of symmetric security and memory hard key derivation.
Hybrid KDF framework combining Keccak-f[1600], SHA-512, and Argon2id for next-generation password hashing and key derivation. Ultra-robust, post-quantum, memory-hard, and production-ready.
Cryptographic library implementing Threefish512, Skein512, and CATENA.
Add a description, image, and links to the memory-hard topic page so that developers can more easily learn about it.
To associate your repository with the memory-hard topic, visit your repo's landing page and select "manage topics."