Cryptography [PART I]

Cryptography

Interesting. DH *can* actually asymmetrically encrypt short messages directly.

Alice's public key is (g^a mod p, g, p), private key is a.

Bob wants to send message 0 < m < p. He picks a random b and sends Alice (m(g^a)^b mod p, g^b mod p).

Alice then computes m(g^a)^b (g^b)^-a = mg^ab g^-ab = m.

let's see how long it takes before someone writes a 2 line perl version of this