Caesar Cipher Python Code Examples for Beginners

📚 Quick Study Guide

• 🔑 The Caesar Cipher is a simple substitution cipher where each letter in the plaintext is shifted a certain number of positions down the alphabet.
• ➗ The formula for encryption is: $E(x) = (x + n) \mod 26$, where $x$ is the letter's position in the alphabet (A=0, B=1, ..., Z=25), and $n$ is the shift value.
• ➖ The formula for decryption is: $D(x) = (x - n) \mod 26$, where $x$ is the ciphertext letter's position, and $n$ is the shift value.
• 🔄 The key is the shift value (n), which can be any integer between 1 and 25 for standard English alphabet.
• 📝 Example: If we shift 'A' by 3, it becomes 'D'. If we shift 'Z' by 1, it wraps around to 'A'.

Practice Quiz

1. Question 1: What is the result of encrypting the letter 'C' with a Caesar cipher and a shift of 2?
   1. A) A
   2. B) B
   3. C) E
   4. D) F
2. Question 2: Which of the following Python code snippets correctly encrypts a single uppercase letter using a Caesar cipher with a shift of 3?
   1. A) chr((ord(letter) + 3 - 65) % 26 + 65)
   2. B) chr((ord(letter) - 3 - 65) % 26 + 65)
   3. C) ord(letter) + 3
   4. D) ord(letter) - 3
3. Question 3: If the ciphertext is 'DEF' and the shift value is 1, what was the original plaintext?
   1. A) EFG
   2. B) CDE
   3. C) ABC
   4. D) GHI
4. Question 4: Which of the following is NOT a limitation of the Caesar cipher?
   1. A) Vulnerable to frequency analysis
   2. B) Only works with alphabetic characters
   3. C) Requires a complex key management system
   4. D) Limited number of possible keys
5. Question 5: What Python code can decrypt the letter 'E' shifted by 2?
   1. A) chr((ord('E') + 2 - 65) % 26 + 65)
   2. B) chr((ord('E') - 2 - 65) % 26 + 65)
   3. C) chr(ord('E') + 2)
   4. D) chr(ord('E') - 2)
6. Question 6: What is the correct way to handle wrapping around the alphabet when decrypting 'A' with a shift of 1?
   1. A) No special handling is needed.
   2. B) Add 26 to the result before taking the modulo.
   3. C) Subtract 26 from the result before taking the modulo.
   4. D) Multiply the result by 26.
7. Question 7: Why is the Caesar cipher considered insecure for modern communication?
   1. A) It's too complex to implement.
   2. B) The key space is too small.
   3. C) It requires specialized hardware.
   4. D) It only works with numbers.