DRBG alternatives and similar packages
Based on the "Cryptography" category.
Alternatively, view DRBG alternatives based on common mentions on social networks and blogs.
-
pedersen-commitment
An implementation of Pedersen commitment schemes -
arithmetic-circuits
Arithmetic circuits for zero knowledge proof systems -
cryptohash
efficient and practical cryptohashing in haskell. DEPRECATED in favor of cryptonite -
cipher-blowfish
DEPRECATED by cryptonite; A collection of cryptographic block and stream ciphers in haskell -
cipher-aes
DEPRECATED - use cryptonite - a comprehensive fast AES implementation for haskell that supports aesni and advanced cryptographic modes. -
crypto-api
Haskell generic interface (type classes) for cryptographic algorithms -
ed25519
Minimal ed25519 Haskell package, binding to the ref10 SUPERCOP implementation. -
skein
Skein, a family of cryptographic hash functions. Includes Skein-MAC as well. -
galois-fft
Finite field polynomial arithmetic based on fast Fourier transforms -
crypto-pubkey
DEPRECATED - use cryptonite - Cryptographic public key related algorithms in haskell (RSA,DSA,DH,ElGamal) -
signable
Deterministic serialisation and signatures with proto-lens and protobuf-elixir support -
crypto-enigma
A Haskell Enigma machine simulator with rich display and machine state details. -
cipher-aes128
Based on cipher-aes, but using a crypto-api interface and providing resulting IVs for each mode -
crypto-numbers
DEPRECATED - use cryptonite - Cryptographic number related function and algorithms
Less time debugging, more time building
* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest.
Do you think we are missing an alternative of DRBG or a related project?
Popular Comparisons
README
The Deterministic Random Bit Generator (DRBG) is a collection of cryptographically secure random bit generators and modifiers written to the NIST 800-90 specification. Namely, the HMAC and Hash generators are implemented and pass the known answer tests (KATS) while the CTR based generator exists with the intent of matching spec but does not pass KATS for unknown reasons (mis-interpretation of KATS or otherwise).
The combinators allow users to combine two or more generators for new desired effects, such as XORing two generators together, using one generator to reseed another (for obtaining a longer lifetime, presumably), and precomputing randoms in batch (buffering).