Search Results

15 results for “cryptography”

Formulae (15)

c = m^e \bmod n

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

m = c^d \bmod n

Recovers the message using the private exponent d.

\varphi(n) = (p-1)(q-1)

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

H = -\sum_i p_i \log_2 p_i

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

H = L \log_2 R

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

K = 2^b

Number of possible keys for a b-bit key.

n \approx 1.177\sqrt{2^b}

Collisions become likely after about √ of the hash space.

d(x,y) = \sum_i [x_i \ne y_i]

Number of positions at which two strings differ.

2^r \ge m + r + 1

Minimum parity bits r needed to protect m data bits.

c = m \oplus k

Bitwise XOR of message and key; XOR again with k to decrypt.

s = B^a \bmod p

Two parties derive the same secret over a public channel.

t = \frac{K}{r}

Time to try every key at a given guess rate.

E[\Delta] = \frac{n}{2}

A good hash flips about half its output bits when one input bit changes.

c = (m + k) \bmod 26

Shift each letter forward by k positions.

P \approx \frac{n^2}{2N}

Approximate chance of a collision among n items in space N.