Cryptograhpy and Networks notes

1.A general cryptosystem consists of a tuple of 5 elements: (M, C, K, E, D) with
the following properties:
10
 1. M : set of all valid messages
 2. C: set of all ciphers (universe of encrypted messages)
3. K: a key space, a set of pairs of the form (e, d), associating a decrypting
key with an encrypting key. In practice it generally makes sense for this to
be a one-to-one function, that is for each encrypting key there is exactly
one decrypting key and vice versa.
Let KE be the set of all the encrypting keys and let KD be the set of all
the decrypting keys; we get them from the set K above. 11
4. E: an encrypting algorithm/machine, E : KE × M → C. That is, given
an encrypting key e and a message m, we get the corresponding cipher:
c = E(e, m).
5. D: a decrypting algorithm/machine, D : KD × C → M . That is, given
a decrypting key d and a cipher c, we get the corresponding message:
m = D(d, c).
6. For any m ∈ M and (e, d) ∈ K: D d, E(e, m) = m, that is, encrypting

the message and decrypting the cipher produces back the message.

2.in information security contexts, cryptographic hash values are sometimes called (digital)fingerprints, checksums, or just hash values, even though all these terms stand for functions with rather different properties and purposes.