View the step-by-step solution to:


1.     A generalization of the Caesar cipher, known as the affine Caesar cipher, has the following form: For

each plaintext letter p, the corresponding ciphertext letter c is computed as:

 c = (ap + b) mod 26 for some integer values a and b.

As mentioned in lecture, a basic requirement of an encryption algorithm is that it be one to one; that is, no two different values of p may map to the same ciphertext value c (otherwise, decryption is impossible.

a)     Is the affine Caesar cipher one-to-one for all values of b? Explain why or why not.

b)     For which values of a is the affine Caesar cipher not one-to-one? Explain why this is the case.

Recently Asked Questions

Why Join Course Hero?

Course Hero has all the homework and study help you need to succeed! We’ve got course-specific notes, study guides, and practice tests along with expert tutors.

  • -

    Study Documents

    Find the best study resources around, tagged to your specific courses. Share your own to gain free Course Hero access.

    Browse Documents
  • -

    Question & Answers

    Get one-on-one homework help from our expert tutors—available online 24/7. Ask your own questions or browse existing Q&A threads. Satisfaction guaranteed!

    Ask a Question
Let our 24/7 Computer Science tutors help you get unstuck! Ask your first question.
A+ icon
Ask Expert Tutors You can ask You can ask You can ask (will expire )
Answers in as fast as 15 minutes
A+ icon
Ask Expert Tutors