Symmetric key cryptography is an application of functions. An encryption function turns readable plain text into unreadable cipher text, and the corresponding decryption function turns the cipher text back into the original plain text.
Descriptions of cryptographic protocols are commonly phrased as interactions between Alice, Bob, and Eve. Alice sends a message to Bob, and the eavesdropper Eve listens in on their conversion and tries to break their encryption (Figure 8.9).
In a symmetric key encryption scheme, Alice and Bob first have to agree on a common shared key. Alice uses the key to encrypt a message and sends the encrypted message to Bob. Then, Bob uses the key to decrypt the encrypted message that was sent by Alice in order to obtain the message in its original form (Figure 8.10). We introduce Caesar ciphers and other substitution ciphers as examples for symmetric key encryption scheme in the following two sections.
Girl: I’m sure you’ve heard all about this sordid affair in those gossipy cryptographic protocol specs with those busybodies Schneier and Rivest, always taking Alice’s side, always labeling me the attacker.
Girl: He said it was nothing, but everything from the public-key authenticated signatures on the files to the lipstick heart smeared on the disk screamed "Alice."
Girl: I didn’t want to believe. Of course on some level I realized it was a known-plain-text attack. But I couldn’t admit it until I saw it for myself.
Girl places her hands on her hips. Girl: So before you so quickly label me a third party to the communication, just remember: I loved him first. We had something and she tore it away. She’s the attacker, not me. - Not eve.
