Security Math

Birthday-problem collision odds for random IDs or hash outputs, or the count of items that reaches a target probability.

Shamir t-of-n secret sharing maths: qualifying subsets, loss tolerance, recovery and compromise odds. Counts only, no secrets.

Bloom filter sizing: bits, bytes and hash count for n items at a false-positive rate, or the rate for a given size.

CRC-32, CRC-32C, Adler-32, FNV-1/1a (32 and 64 bit) and MurmurHash3 x86_32 of text or hex bytes. Not cryptographic.

Time to brute-force a space of N bits (or N guesses) at a guesses-per-second rate: average, worst case, and presets.

Encoded length of N bytes in hex, base64, base32, base58, base85, decimal or any base-N alphabet, and bytes per N characters.

NIST SP 800-57 comparable strengths: RSA, DH, DSA, ECC and AES key sizes to security bits, hash strengths, 2030 status.

Entropy bits for a random password policy, PIN or diceware passphrase from length and alphabet, with crack-time ranges.