Cryptography & Security

Advanced

Hamming Code Parity Bits

Minimum parity bits r needed to protect m data bits.

Formula

2^r \ge m + r + 1

Variables

rParity bits

mData bits

Example

m=4: r=3 satisfies 8 ≥ 4+3+1

Did You Know?

Hamming(7,4) codes can correct any single-bit error — the ancestor of modern ECC memory.

cryptography hamming error correction

Share this formula

More in Cryptography & Security

Modular Exponentiation

Core operation of RSA encryption — raise a message to a power, modulo n.

RSA Decryption

Recovers the message using the private exponent d.

Euler's Totient

Counts integers below n coprime to it, for n = pq — used to make RSA keys.

Shannon Entropy

Average information content — and the theoretical strength of a random source.

Password Entropy

Bits of security from password length and character-set size.

Key Space Size

Number of possible keys for a b-bit key.